Results 1  10
of
1,347
Implementing PublicKey Cryptography in
, 2001
"... In this paper we describe how the RSA publickey cipher can be implemented in the functional programming language Haskell and we present a complete working implementation. This implementation serves two useful pedagogical purposes: (1) it is a very clear, highlevel implementation of RSA that can e ..."
Abstract
 Add to MetaCart
In this paper we describe how the RSA publickey cipher can be implemented in the functional programming language Haskell and we present a complete working implementation. This implementation serves two useful pedagogical purposes: (1) it is a very clear, highlevel implementation of RSA that can
Publickey cryptosystems based on composite degree residuosity classes
 IN ADVANCES IN CRYPTOLOGY — EUROCRYPT 1999
, 1999
"... This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to publickey cryptography. We propose a new trapdoor mechanism and derive from this technique three encryption schemes: a trapdoor permutation and two homomorphic probabilist ..."
Abstract

Cited by 1009 (4 self)
 Add to MetaCart
This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to publickey cryptography. We propose a new trapdoor mechanism and derive from this technique three encryption schemes: a trapdoor permutation and two homomorphic
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
, 1987
"... In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys. The schemes are provably secure against any known or chosen message attack ff factoring is difficult ..."
Abstract

Cited by 1028 (1 self)
 Add to MetaCart
In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys. The schemes are provably secure against any known or chosen message attack ff factoring
A new publickey cryptosystem as secure as factoring
 In Eurocrypt '98, LNCS 1403
, 1998
"... Abstract. This paper proposes a novel publickey cryptosystem, which is practical, provably secure and has some other interesting properties as follows: 1. Its trapdoor technique is essentially different from any other previous schemes including RSARabin and DiffieHellman. 2. It is a probabilistic ..."
Abstract

Cited by 208 (7 self)
 Add to MetaCart
Abstract. This paper proposes a novel publickey cryptosystem, which is practical, provably secure and has some other interesting properties as follows: 1. Its trapdoor technique is essentially different from any other previous schemes including RSARabin and DiffieHellman. 2. It is a
On the Importance of Checking Cryptographic Protocols for Faults
, 1997
"... We present a theoretical model for breaking various cryptographic schemes by taking advantage of random hardware faults. We show how to attack certain implementations of RSA and Rabin signatures. An implementation of RSA based on the Chinese Remainder Theorem can be broken using a single erroneous s ..."
Abstract

Cited by 405 (6 self)
 Add to MetaCart
. Schnorr's protocol can also be broken, but a larger number of erroneous executions is needed. Keywords: Hardware faults, Cryptanalysis, RSA, FiatShamir, Schnorr, Public key systems, Identification protocols. 1 Introduction Direct attacks on the famous RSA cryptosystem seem to require that one factor
PublicKey Cryptosystems from Lattice Reduction Problems
, 1996
"... We present a new proposal for a trapdoor oneway function, from whichwe derive publickey encryption and digital signatures. The security of the new construction is based on the conjectured computational difficulty of latticereduction problems, providing a possible alternative to existing publicke ..."
Abstract

Cited by 148 (4 self)
 Add to MetaCart
We present a new proposal for a trapdoor oneway function, from whichwe derive publickey encryption and digital signatures. The security of the new construction is based on the conjectured computational difficulty of latticereduction problems, providing a possible alternative to existing publickey
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
 PROCEEDINGS OF THE TWENTYFIRST ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1989
"... In this paper we prove the intractability of learning several classes of Boolean functions in the distributionfree model (also called the Probably Approximately Correct or PAC model) of learning from examples. These results are representation independent, in that they hold regardless of the syntact ..."
Abstract

Cited by 347 (14 self)
 Add to MetaCart
of the syntactic form in which the learner chooses to represent its hypotheses. Our methods reduce the problems of cracking a number of wellknown publickey cryptosystems to the learning problems. We prove that a polynomialtime learning algorithm for Boolean formulae, deterministic finite automata or constant
Unbreakable Codes: RSA Public Key
"... A Public Key Cryptosystem uses encoding keys that are the form of modulus � and the exponent � which can be distributed to the public while the decoding method remains secure. Public Key Cryptosystems are also known as RSA coding, which are used often because the internet runs on open networks. Publ ..."
Abstract
 Add to MetaCart
A Public Key Cryptosystem uses encoding keys that are the form of modulus � and the exponent � which can be distributed to the public while the decoding method remains secure. Public Key Cryptosystems are also known as RSA coding, which are used often because the internet runs on open networks
Differential Fault Analysis of Secret Key Cryptosystems
, 1997
"... In September 1996 Boneh, Demillo, and Lipton from Bellcore announced a new type of cryptanalytic attack which exploits computational errors to find cryptographic keys. Their attack is based on algebraic properties of modular arithmetic, and thus it is applicable only to public key cryptosystems suc ..."
Abstract

Cited by 315 (3 self)
 Add to MetaCart
In September 1996 Boneh, Demillo, and Lipton from Bellcore announced a new type of cryptanalytic attack which exploits computational errors to find cryptographic keys. Their attack is based on algebraic properties of modular arithmetic, and thus it is applicable only to public key cryptosystems
DOI 10.1007/s112270110627z Molecular solutions of the RSA publickey cryptosystem on a DNAbased computer
, 2011
"... © Springer Science+Business Media, LLC 2011 Abstract The RSA publickey cryptosystem is an algorithm that converts a plaintext to its corresponding ciphertext, and then converts the ciphertext back into its corresponding plaintext. In this article, we propose five DNAbased algorithms— parallel ..."
Abstract
 Add to MetaCart
© Springer Science+Business Media, LLC 2011 Abstract The RSA publickey cryptosystem is an algorithm that converts a plaintext to its corresponding ciphertext, and then converts the ciphertext back into its corresponding plaintext. In this article, we propose five DNAbased algorithms— parallel
Results 1  10
of
1,347