Journal of Mathematical Cryptology
Managing Editor: Magliveras, Spyros S. / Steinwandt, Rainer / Trung, Tran
Editorial Board Member: Blackburn, Simon R. / Blundo, Carlo / Burmester, Mike / Cramer, Ronald / Dawson, Ed / Gilman, Robert / Gonzalez Vasco, Maria Isabel / Grosek, Otokar / Helleseth, Tor / Kim, Kwangjo / Koblitz, Neal / Kurosawa, Kaoru / Lauter, Kristin / Lange, Tanja / Menezes, Alfred / Nguyen, Phong Q. / Pieprzyk, Josef / Rötteler, Martin / Safavi-Naini, Rei / Shparlinski, Igor E. / Stinson, Doug / Takagi, Tsuyoshi / Williams, Hugh C. / Yung, Moti
4 Issues per year
Mathematical Citation Quotient 2013: 0.30
Volume 7 (2013)
Volume 6 (2012)
Volume 5 (2011)
Volume 4 (2010)
Volume 3 (2009)
Volume 2 (2008)
Most Downloaded Articles
- Advanced stochastic methods in side channel analysis on block ciphers in the presence of masking by Schindler, Werner
- Security of blind signatures under aborts and applications to adaptive oblivious transfer by Fischlin, Marc and Schröder, Dominique
- Erratum Self-pairings on hyperelliptic curves [J. Math. Cryptol. 7 (2013), 31–42] by Galbraith, Steven D. and Zhao, Chang-An
- Persistent asymmetric password-based key exchange by Jiang, Shaoquan
- Constructing elliptic curve isogenies in quantum subexponential time by Childs, Andrew/ Jao, David and Soukharev, Vladimir
A Summary of McEliece-Type Cryptosystems and their Security
1TU Darmstadt, Department of Computer Science, Cryptography and Computer Algebra Group Hochschulstraße 10, 64298 Darmstadt, Germany.
3TU Darmstadt, GK Electronic Commerce, Department of Computer Science, Cryptography and Computer Algebra Group Hochschulstraße 10, 64298 Darmstadt, Germany.
5TU Darmstadt, Department of Computer Science, Cryptography and Computer Algebra Group Hochschulstraße 10, 64298 Darmstadt, Germany.
Citation Information: Journal of Mathematical Cryptology JMC. Volume 1, Issue 2, Pages 151–199, ISSN (Online) 1862-2984, ISSN (Print) 1862-2976, DOI: 10.1515/JMC.2007.009, May 2007
- Published Online:
In this paper we give an overview of some of the cryptographic applications which were derived from the proposal of R. J. McEliece to use error correcting codes for cryptographic purposes. Code based cryptography is an interesting alternative to number theoretic cryptography. Many basic cryptographic functions like encryption, signing, hashing, etc. can be realized using code theoretic concepts.
In this paper we briefly show how to correct errors in transmitted data by employing Goppa codes and describe possible applications to public key cryptography.
The main focus of this paper is to provide detailed insight into the state of art of cryptanalysis of the McEliece cryptosystem and the effect on different cryptographic applications. We conclude, that for code based cryptography a public key of 88KB offers sufficient security for encryption, while we need a public key of at least 597KB for secure signing.