McEliece, R., A public-key cryptosystem based on algebraic coding theory, DSN Progress Report 42--44, 1978, 114-116. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
c flCopyright by - Tock (Correct)
....and decryption, and knowledge of one does not necessarily help determine the other. In particular, knowledge of the encryption key should reveal nothing about the decryption key. There are effectively only two asymmetric encryption systems with these properties, the RSA [RSA78] and McEliece [McE78] systems, though many more have been proposed and been shown to be unsecure. Since the McEliece system uses keys with size on the order 100 KBytes, only RSA is considered to be practical and is assumed throughout the remainder of this subsection. Because knowledge of the encryption key does not ....
R. McEliece. A Public-Key Cryptosystem Based on Algebraic Coding Theory. In DSN Progress Report 42--44, pages 114--116. Jet Propulsion Laboratory, Pasadena, CA, 1978.
Reaction Attacks Against Several Public-Key Cryptosystems - Hall, Goldberg, Schneier (1997) (12 citations) (Correct)
....errorcorrecting codes, Ajtai Dwork lattice cryptosystem, McEliece. 1 Introduction In an attempt to design cryptosystems based upon (believed) intractible problems di erent from factoring and discrete logarithms, several public key cryptosystems have been presented, including the two systems in [M78,AD97]. The rst system is based upon the intractibility of decoding an arbitrary errorcorrecting code, and the second upon nding the shortest vector in a lattice. The authors of the former rely upon the fact that the respective problem is known to be NP complete. However, it is not known whether the ....
....both of these systems. Finally, in section 4 we discuss the properties of these public key cryptosystems which allowed our attacks to work in order to try and give some design criterion for new public key cryptosystems so that they will not be vulnerable to the same sort of attack. 2 McEliece In [M78], McEliece outlined a public key cryptosystem based upon error correcting codes. A user chooses a n k generator matrix G (for a (n; k) error correcting code which can correct up to t errors) a k k non singular matrix S, a n n permutation matrix P , and publishes the matrix G = SGP as his ....
[Article contains additional citation context not shown here]
R.J. McEliece, \A Public-Key Cryptosystem Based on Algebraic Coding Theory," Deep Space Network Progress Report 42-44, Jet Propulsion Laboratory, California Institute of Technology, 1978, pp. 104-113.
Can One Design a Signature Scheme Based on Error-Correcting Codes? - Stern (1995) (2 citations) (Correct)
....at the discovery of alternatives to the standard techniques based on arithmetical properties of large numbers. In order to achieve such a program, error correcting codes seemed quite attractive. As soon as 1978, a public key cryptosystem based on the use of Goppa codes was proposed by Mc Eliece in [3]. This cryptosystem is still standing. Concerning the problem of identification, a scheme was proposed by the author in [4] This time, random codes with no specific structure were used. It is of course possible to turn our authentication scheme into a signature scheme by the standard technique ....
R. J. McEliece, Public key cryptosystem based on algebraic coding theory, JPLDSN Progress Report 42-44, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, USA, January and February 1978, 114-116.
EPOC: Efficient Probabilistic Public-Key Encryption - Fujisaki, Kobayashi.. (Correct)
.... [15] and the elliptic hyperelliptic curve versions of the Diffie Hellman and ElGamal [28, 21, 8] Several other techniques have been proposed such as the GoldwasserMicali scheme [18] based on quadratic residuosity, the Ajtai Dwark scheme [3] based on the lattice problem, the McEliece scheme [26] based on the error correcting code, knapsack type cryptosystems including the Merkle Hellman, Chor Rivest and Naccache Stern schemes [27, 9, 29] and multivariate polynomial type cryptosystems including the Matsumoto Imai and PatarinGoubin schemes [25, 33, 34] However they are not so efficient ....
McEliece, R.J.: A Public-Key Cryptosystem Based on Algebraic Coding Theory, DSN progress report 42-44, Jet Propulsion Laboratories, Pasadena (1978).
How to Achieve a McEliece-based Digital Signature Scheme - Courtois, Finiasz, Sendrier (2001) (8 citations) Self-citation (Mceliece) (Correct)
No context found.
R. J. McEliece. A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep., Jet Prop. Lab., California Inst. Technol., Pasadena, CA, pages 114--116, January 1978.
Semantically Secure McEliece Public-Key Cryptosystems -.. - Kobara, Imai (2001) (2 citations) Self-citation (Mceliece) (Correct)
No context found.
R. J. McEliece. \A Public-Key Cryptosystem Based on Algebraic Coding Theory". In Deep Space Network Progress Report, 1978.
Enumeration Of Inequivalent Irreducible Goppa Codes - John Ryan And (Correct)
No context found.
McEliece, R., A public-key cryptosystem based on algebraic coding theory, DSN Progress Report 42--44, 1978, 114-116.
A Fuzzy Sketch with Trapdoor - Bringer, Chabanne, Do (2005) (Correct)
No context found.
R.J. McEliece, A public-key cryptosystem based on algebraic coding theory, JPL DSN Progress Report, 1978, pp. 114--116.
Public-Key Cryptosystems Based on Composite - Degree Residuosity Classes (Correct)
No context found.
R. McEliece, A Public-Key Cryptosystem Based on Algebraic Coding Theory, DSN Progress Report 42-44, Jet Propulsion Laboratories, Pasadena, 1978.
Public-Key Cryptosystems Based on Composite - Degree Residuosity Classes (Correct)
No context found.
R. McEliece, A Public-Key Cryptosystem Based on Algebraic Coding Theory, DSN Progress Report 42-44, Jet Propulsion Laboratories, Pasadena, 1978.
Public-Key Cryptosystems - From Lattice Reduction (1996) (Correct)
No context found.
R.J. McEliece, A Public-Key Cryptosystem Based on Algebraic Coding Theory. DSN Progress Report 42-44, Jet Propulsion Laboratory
Post-Quantum Signatures - Buchmann, Coronado, Döring.. (2004) (Correct)
No context found.
R.J. McEliece, A public key cryptosystem based on algebraic coding theory, DSN progress report 42-44 (1978), 114--116.
Public-Key Cryptosystems Based on Composite Degree Residuosity.. - Paillier (1999) (144 citations) (Correct)
No context found.
R. McEliece, A Public-Key Cryptosystem Based on Algebraic Coding Theory, DSN Progress Report 42-44, Jet Propulsion Laboratories, Pasadena, 1978.
Secure Direct Communication Using Quantum.. - Lu, Ma, Feng (2004) (Correct)
No context found.
McEliece R.J.: A public-key cryptosystem based on algebraic coding theory, DSN Prog. Rep., Jet Prop. Lab., Caltech, Jan (1978) 114-116.
Cryptanalyzing the Polynomial-Reconstruction based Public-Key.. - Kiayias, Yung (2004) (Correct)
No context found.
Robert J. McEliece. A public key cryptosystem based on algebraic coding theory. Jet Propulsion Lab, DSN Progress Report, 42(44), pp. 114--116, Jan-Feb 1978.
Design of a Secure and Fault Tolerant Environment for.. - Arnab Paul Sameer (2004) (Correct)
No context found.
R. J. McEliece. A public key cryptosystem based on algebraic coding theory. Jet Propulsion Lab, DSN Progress Report, 42(44):114--116, Jan-Feb 1978.
Enumeration Of Inequivalent Irreducible Goppa Codes - John Ryan And (2004) (Correct)
No context found.
McEliece, R., A public-key cryptosystem based on algebraic coding theory, DSN Progress Report 42--44, 1978, 114-116.
On the Complexity of Some Cryptographic Problems Based on.. - Johansson, Jönsson (1998) (1 citation) (Correct)
No context found.
R.J. McEliece, "A public-key cryptosystem based on algebraic coding theory," Jet Propulsion Lab. DSN Progress Rep., pp. 114--116, 1978.
A Fast Provably Secure Cryptographic Hash Function - Augot, Finiasz, Sendrier (2003) (2 citations) (Correct)
No context found.
R. J. McEliece. A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep., Jet Prop. Lab., California Inst. Technol., Pasadena, CA, pages 114--116, January 1978.
Public-Key Cryptosystems Based on Composite Degree Residuosity.. - Paillier (1999) (144 citations) (Correct)
No context found.
R. McEliece, A Public-Key Cryptosystem Based on Algebraic Coding Theory, DSN Progress Report 42-44, Jet Propulsion Laboratories, Pasadena, 1978.
Some Applications of Coding Theory in Computational Complexity - Trevisan (2004) (Correct)
No context found.
R.J. McEliece. A public-key cryptosystem based on algebraic coding theory. JPL DSN Progress Report, 42-44:114--116, 1978.
Public-Key Cryptosystems Based on Composite - Degree Residuosity Classes (Correct)
No context found.
R. McEliece, A Public-Key Cryptosystem Based on Algebraic Coding Theory, DSN Progress Report 42-44, Jet Propulsion Laboratories, Pasadena, 1978.
Unknown - Tr Electronic Colloquium (1996) (Correct)
No context found.
R.J. McEliece, A Public-Key Cryptosystem Based on Algebraic Coding Theory. DSN Progress Report 42-44, Jet Propulsion Laboratory
On the Security of Digital Signature Schemes Based on.. - Xu, Doumen, van Tilborg (2003) (1 citation) (Correct)
No context found.
R.J. McEliece, A public--key Cryptosystem Based on Algebraic Coding Theory, DSN progress report 42--44, pp.114--116, 1978.
Semirings and Semigroup Actions in Public-Key Cryptography - Monico (2002) (Correct)
No context found.
R. J. McEliece. A public-key cryptosystem based on algebraic coding theory. Technical report, DSN Progress report # 42-44, Jet Propulsion Laboratory, Pasadena, Californila, 1978.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC