Post-quantum cryptography

Code-based public-key cryptography

Encryption and decryption using binary Goppa codes

1978. Robert J. McEliece. "A public-key cryptosystem based on algebraic coding theory." Jet Propulsion Laboratory DSN Progress Report 42–44, 114–116. http://ipnpr.jpl.nasa.gov/progress_report2/42-44/44N.PDF

1986. Harald Niederreiter. "Knapsack-type cryptosystems and algebraic coding theory." Problems of Control and Information Theory 15, 19–34. Problemy Upravlenija i Teorii Informacii 15, 159–166.

1995. Nicolas Sendrier. "Efficient generation of binary words of given weight." Pages 184–187 in: Colin Boyd (editor). Cryptography and Coding, 5th IMA conference, Cirencester, UK, December 18–20, 1995, proceedings. Lecture Notes in Computer Science 1025. Springer. ISBN 3-540-60693-9. http://www.springerlink.com/content/y43w30176331547m/fulltext.pdf

2005. Nicolas Sendrier. "Encoding information into constant weight words." Pages 435–438 in: Information theory, 2005. ISIT 2005. Proceedings. IEEE. http://ieeexplore.ieee.org/iel5/10215/32581/01523371.pdf?arnumber=1523371

2008. Bhaskar Biswas, Nicolas Sendrier. "McEliece cryptosystem implementation: theory and practice." Pages 47–62 in: Johannes Buchmann, Jintai Ding (editors). Post-quantum cryptography, second international workshop, PQCrypto 2008, Cincinnati, OH, USA, October 17–19, 2008, proceedings. Lecture Notes in Computer Science 5299, Springer.

2008. Falko Strenzke, Erik Tews, H. Gregor Molter, Raphael Overbeck, Abdulhadi Shoufan. "Side channels in the McEliece PKC." Pages 216–229 in: Johannes Buchmann, Jintai Ding (editors). Post-quantum cryptography, second international workshop, PQCrypto 2008, Cincinnati, OH, USA, October 17–19, 2008, proceedings. Lecture Notes in Computer Science 5299, Springer.

2008. Daniel J. Bernstein. "List decoding for binary Goppa codes." http://cr.yp.to/papers.html#goppalist

Paddings, protocols, proofs

1997. Thomas A. Berson. "Failure of the McEliece public-key cryptosystem under message-resend and related-message attack." Pages 213–220 in: Burton S. Kaliski, Jr. (editor). Advances in Cryptology—CRYPTO '97. 17th annual international cryptology conference, Santa Barbara, California, USA, August 17–21, 1997, proceedings. Lecture Notes in Computer Science 1294. Springer. http://www.springerlink.com/index/g6708p04m618g7r1.pdf

2000. Hung-Min Sun. "Enhancing the security of the McEliece public-key cryptosystem." MR 2001m:94050. Journal of Information Science and Engineering 16, 799–812.

2001. Kazukuni Kobara, Hideki Imai. "Semantically secure McEliece public-key cryptosystems—conversions for McEliece PKC." MR 2003c:94027. Pages 19–35 in: Kwangjo Kim (editor). Public key cryptography. Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptosystems (PKC 2001) held on Cheju Island, February 13–15, 2001. Lecture Notes in Computer Science 1992, Springer. http://citeseer.ist.psu.edu/685731.html

2002. Eric R. Verheul, Jeroen M. Doumen, Henk C. A. van Tilborg. "Sloppy Alice attacks! Adaptive chosen ciphertext attacks on the McEliece public-key cryptosystem." MR 2005b:94041. Pages 99–119 in: Mario Blaum, Patrick G. Farrell, Henk C. A. van Tilborg (editors). Information, coding and mathematics. Kluwer International Series in Engineering and Computer Science 687. Kluwer. MR 2005a:94003. http://doc.utwente.nl/56319/1/sa.pdf

2003. Kazukuni Kobara, Hideki Imai. "On the one-wayness against chosen-plaintext attacks of the Loidreau's modified McEliece PKC." IEEE Transactions on Information Theory 49, 3160–3168. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1255542

2008. Ryo Nojima, Hideki Imai, Kazukuni Kobara, Kirill Morozov. "Semantic security for the McEliece cryptosystem without random oracles." Designs, Codes and Cryptography 49, 289–305. MR 2438457. http://staff.aist.go.jp/kirill.morozov/docs/nikm07semantic.pdf

Attacks via general decoding

1988. Carlisle M. Adams, Henk Meijer. "Security-related comments regarding McEliece's public-key cryptosystem." IEEE Transactions on Information Theory 35, 454–455. MR 0999658. Previous version: MR 0956653. Pages 224–228 in: Carl Pomerance (editor). Advances in cryptology—CRYPTO '87. Proceedings of the Conference on the Theory and Applications of Cryptographic Techniques held at the University of California, Santa Barbara, California, August 16–20, 1987. Lecture Notes in Computer Science 293. Springer. ISBN 3-540-18796-0. MR 89b:68005. http://dsns.csie.nctu.edu.tw/research/crypto/HTML/PDF/C87/224.PDF

1988. Pil Joong Lee, Ernest F. Brickell. "An observation on the security of McEliece's public-key cryptosystem." MR 0994669. Pages 275–280 in: Christoph G. Guenther (editor). Advances in cryptology—EUROCRYPT '88. Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques held in Davos, May 25–27, 1988. Lecture Notes in Computer Science 330, Springer, Berlin. ISBN 3-540-50251-3. http://dsns.csie.nctu.edu.tw/research/crypto/HTML/PDF/E88/275.PDF

1988. Jeffrey S. Leon. "A probabilistic algorithm for computing minimum weights of large error-correcting codes." IEEE Transactions on Information Theory 34, 1354–1359. MR 89k:94072. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=21270

1989. Jacques Stern. "A method for finding codewords of small weight." MR 1023683. Pages 106–113 in: Gerard D. Cohen, Jacques Wolfmann (editors). Coding theory and applications. Proceedings of the Third International Colloquium on Coding Theory held in Toulon, November 2–4, 1988. Lecture Notes in Computer Science 388, Springer, New York. ISBN 0-387-51643-3. MR 90i:94001. http://www.springerlink.com/index/7g665155m26n9g72.pdf

1990. Johan van Tilburg. "On the McEliece public-key cryptosystem." MR 1046386. Pages 119–131 in: Shafi Goldwasser (editor). Advances in cryptology—CRYPTO '88. Proceedings of the Conference on the Theory and Application of Cryptography held at the University of California, Santa Barbara, California, August 21–25, 1988. Lecture Notes in Computer Science 403, Springer, Berlin. ISBN 3-540-97196-3. MR 90j:94003. http://www.springerlink.com/index/4U90Y754YET8DUKP.pdf

1993. Herve Chabanne, B. Courteau. "Application de la méthode de décodage itérative d’Omura à la cryptanalyse du système de Mc Eliece." Université de Sherbrooke, Rapport de Recherche, number 122.

1993. Florent Chabaud. "Asymptotic analysis of probabilistic algorithms for finding short codewords." MR 95e:94026. Pages 175–183 in: Paul Camion, Pascale Charpin, S. Harari (editors). Eurocode '92. Proceedings of the International Symposium on Coding Theory and Applications held in Udine, October 23–30, 1992. Springer. ISBN 3-211-82519-3. MR 94k:94001.

1994. Johan van Tilburg. "Security-analysis of a class of cryptosystems based on linear error-correcting codes." Ph.D. thesis, Technische Universiteit Eindhoven. ISBN 90-72125-45-2. MR 95k:94025.

1994. Anne Canteaut, Herve Chabanne. "A further improvement of the work factor in an attempt at breaking McEliece's cryptosystem." In: Pascale Charpin (editor). EUROCODE 94. http://www.inria.fr/rrrt/rr-2227.html

1998. Alexei E. Ashikhmin, Alexander Barg. "Minimal vectors in linear codes." IEEE Transactions on Information Theory 44, 2010–2017. http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=705584

1998. Anne Canteaut, Florent Chabaud. "A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511." IEEE Transactions on Information Theory 44, 367–378. MR 98m:94043. ftp://ftp.inria.fr/INRIA/tech-reports/RR/RR-2685.ps.gz

1998. Anne Canteaut, Nicolas Sendrier. "Cryptanalysis of the original McEliece cryptosystem." MR 2000i:94042. Pages 187–199 in: Kazuo Ohta, Dingyi Pei (editors). Advances in cryptology—ASIACRYPT'98. Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security held in Beijing, October 18–22, 1998. Lecture Notes in Computer Science 1514, Springer, Berlin. ISBN 3-540-65109-8. http://www.springerlink.com/index/64RNX94MG0Y32KNG.pdf

2001. A. Al Jabri. "A statistical decoding algorithm for general linear block codes." MR 2074098. Pages 1–8 in: Bahram Honary (editor). Cryptography and coding. Proceedings of the 8th IMA International Conference held in Cirencester, December 17–19, 2001. Lecture Notes in Computer Science 2260. Springer.

2002. Thomas Johansson, Fredrik Jonsson. "On the complexity of some cryptographic problems based on the general decoding problem." IEEE Transactions on Information Theory 48, 2669–2678. http://www.it.lth.se/cryptology/e-papers/paper054.pdf

2006. Raphael Overbeck. "Statistical decoding revisited." Pages 283–294 in: Lynn Batten, Reihaneh Safavi-Naini (editors). Information security and privacy: 11th Australasian conference, ACISP 2006, Melbourne, Australia, July 3–5, 2006, proceedings. Lecture Notes in Computer Science 4058. Springer.

2007. Marc P. C. Fossorier, Kazukuni Kobara, Hideki Imai. "Modeling bit flipping decoding based on nonorthogonal check sums with application to iterative decoding attack of McEliece cryptosystem." IEEE Transactions on Information Theory 53, 402–411. MR 2007m:94158. http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4039662&isnumber=4039640

2008. Daniel J. Bernstein, Tanja Lange, Christiane Peters. "Attacking and defending the McEliece cryptosystem." Pages 31–46 in: Johannes Buchmann, Jintai Ding (editors). Post-quantum cryptography, second international workshop, PQCrypto 2008, Cincinnati, OH, USA, October 17–19, 2008, proceedings. Lecture Notes in Computer Science 5299, Springer. http://eprint.iacr.org/2008/318

2009. Matthieu Finiasz, Nicolas Sendrier. "Security bounds for the design of code-based cryptosystems." Asiacrypt 2009. http://eprint.iacr.org/2009/414

2009. Christiane Peters. "Information-set decoding for linear codes over Fq." http://eprint.iacr.org/2009/589

Alternatives to binary Goppa codes

1992. Vladimir M. Sidelnikov, Sergey O. Shestakov. Russian: "On an encoding system constructed on the basis of generalized Reed-Solomon codes." Diskretnaya Matematika 4, 57–63. English: "On insecurity of cryptosystems based on generalized Reed-Solomon codes." Discrete Mathematics and Applications 2, 439–444.

1994. Vladimir M. Sidelnikov. Russian: "Open coding based on Reed-Muller binary codes." Diskretnaya Matematika 6, 3–20. English: "A public-key cryptosystem based on binary Reed-Muller codes." Discrete Mathematics and Applications 4, 191–207.

1994. Nicolas Sendrier. "On the structure of a randomly permuted concatenated code." In: Pascale Charpin (editor). EUROCODE 94. http://hal.inria.fr/docs/00/07/42/16/PDF/RR-2460.pdf

1995. Ernst M. Gabidulin. "Public-key cryptosystems based on linear codes over large alphabets: efficiency and weakness." Pages 17–31 in: P. G. Farrell (editor). 4th IMA conference on cryptography and coding, the Institute of Mathematics and its Applications, Southend-on-Sea, England, 1993.

1996. Heeralal Janwa, Oscar Moreno. "McEliece public key cryptosystems using algebraic-geometric codes." Designs, Codes and Cryptography 8, 293–307. MR 97f:94009. http://www.springerlink.com/index/Q712313103566685.pdf

1997. Erez Petrank, Ron M. Roth. "Is code equivalence easy to decide?" IEEE Transactions on Information Theory 43, 1602–1604. http://www.cs.technion.ac.il/~erez/Papers/pr.ps

1997. Nicolas Sendrier. "On the dimension of the hull." SIAM Journal on Discrete Mathematics 10, 282–293. MR 97m:11153. http://hal.archives-ouvertes.fr/docs/00/07/40/09/PDF/RR-2682.pdf

1998. Nicolas Sendrier. "On the concatenated structure of a linear code." Applicable Algebra in Engineering, Communication and Computing 9, 221–242. MR 99i:94066.

2000. Nicolas Sendrier. "Finding the permutation between equivalent linear codes: the support splitting algorithm." IEEE Transactions on Information Theory 46, 1193–1203. MR 2001e:94017. http://hal.inria.fr/docs/00/07/30/37/PDF/RR-3637.pdf

2000. Pierre Loidreau. "Strengthening McEliece cryptosystem." MR 2002g:94042. Pages 585–598 in: Tatsuaki Okamoto (editor). Advances in cryptology—ASIACRYPT 2000. Proceedings of the 6th Annual International Conference on the Theory and Application of Cryptology and Information Security held in Kyoto, December 3–7, 2000. Lecture Notes in Computer Science 1976, Springer. MR 2002d:94046. http://www.springerlink.com/index/0GJBTYKKCF8E1HG2.pdf

2001. Pierre Loidreau, Nicolas Sendrier. "Weak keys in the McEliece public-key cryptosystem." IEEE Transactions on Information Theory 47, 1207–1211. MR 2002f:94049. http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=915687

2004. G. A. Karpunin. "On the McEliece public-key cryptosystem based on Reed-Muller binary codes." Russian version: Diskretnaya Matematika 16, 79–84. English version: Discrete Mathematics and Applications 14, 257–262. MR 2005c:94051.

2005. Thierry P. Berger, Pierre Loidreau. "How to mask the structure of codes for a cryptographic use." Designs, Codes and Cryptography 35, 63–79. MR 2006d:94038. http://www.springerlink.com/index/JR001118R1567U13.pdf

2005. Philippe Gaborit. "Shorter keys for code based cryptography." http://www.unilim.fr/pages_perso/philippe.gaborit/ Pages 81--90 in: WCC 2005. http://www.unilim.fr/pages_perso/philippe.gaborit/

2006. Christian Wieschebrink. "An attack on a modified Niederreiter encryption scheme." MR 2423179. Pages 14–26 in: Moti Yung, Yevgeniy Dodis, Aggelos Kiayias, Tal Malkin (editors). Public key cryptography—PKC 2006. Proceedings of the 9th International Conference on Theory and Practice of Public-Key Cryptography held in New York, April 24–26, 2006. Lecture Notes in Computer Science 3958. Springer. MR 2009a:94034. http://www.springerlink.com/index/b663t45486675328.pdf

2007. Lorenz Minder, Amin Shokrollahi. "Cryptanalysis of the Sidelnikov cryptosystem." Pages 347–360 in: Moni Naor (editor). Advances in Cryptology—EUROCRYPT 2007. 26th annual international conference on the theory and applications of cryptographic techniques, Barcelona, Spain, May 20–24, 2007, proceedings. Lecture Notes in Computer Science 4515. Springer. ISBN 978-3-540-72539-8. http://infoscience.epfl.ch/record/112308/files/2007_cryptanalysis_sidelnikov.pdf

2007. Raphael Overbeck. "Recognizing the structure of permuted reducible codes." Pages 269–276 in: WCC 2007. http://www.informatik.tu-darmstadt.de/GK/staff/overbeck.html.

2007. Marco Baldi. "LDPC codes in the McEliece cryptosystem: attacks and countermeasures." http://arxiv.org/abs/0710.0142.

2009. Thierry Berger, Pierre-Louis Cayrel, Philippe Gaborit, Ayoub Otmani. "Reducing key length of the McEliece cryptosystem." Africacrypt 2009. http://cayrel.net/IMG/pdf/2009_-_Reducing_Key_Length_of_the_McEliece_Cryptosystem.pdf

2009. Rafael Misoczki, Paulo S. L. M. Barreto. "Compact McEliece keys from Goppa codes." http://eprint.iacr.org/2009/187.pdf

2009. Christian Wieschebrink. "Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes." http://eprint.iacr.org/2009/452.pdf

2009. Valerie Gauthier Umana, Gregor Leander. "Practical key recovery attacks on two McEliece variants." http://eprint.iacr.org/2009/509.pdf

Rank-metric codes

1995. Kefei Chen. "Rangabstandscodes und ihre Anwendungen in der Kryptographie." Mitteilungen aus dem Mathematischen Seminar Giessen 220. MR 96g:94013.

1995. J. K. Gibson. "Severely denting the Gabidulin version of the McEliece public key cryptosystem." Designs, Codes and Cryptography 6, 37–45. MR 1334199. http://www.springerlink.com/index/G980X82N7045L487.pdf

1996. Florent Chabaud, Jacques Stern. "The cryptographic security of the syndrome decoding problem for rank distance codes." Pages 368–381 in: Kwangjo Kim, Tsutomu Matsumoto (editors). Advances in cryptology—ASIACRYPT '96: international conference on the theory and applications of cryptology and information security, Kyongju, Korea, November 3–7, 1996, proceedings. Lecture Notes in Computer Science 1163. Springer. ISBN 3-540-61872-4. MR 98g:94001. http://fchabaud.free.fr/English/Publications/CS96.pdf

2001. Ernst M. Gabidulin, Alexei V. Ourivski. "Modified GPT PKC with right scrambler." Electronic Notes in Discrete Mathematics 6, 168–177.

2002. Thierry P. Berger, Pierre Loidreau. "Security of the Niederreiter form of the GPT public-key cryptosystem." Page 267 in: Proceedings 2002 IEEE international symposium on information theory, 30 June–5 July 2002. IEEE. ISBN 0-7803-7501-7.

2002. Alexei V. Ourivski, Thomas Johansson. "New technique for decoding codes in the rank metric and its cryptography applications." Problems of Information Transmission 38, 237­-246. http://www.springerlink.com/index/R4K48818H4RU0015.pdf

2003. Ernst M. Gabidulin, Alexei V. Ourivski, Bassem Ammar, Bahram Honary. "Reducible rank codes and applications to cryptography." IEEE Transactions on Information Theory 49, 3289-­3293. MR 2005a:94055. http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1255556 Previous version: 2002. MR 2005b:94030. Pages 121–132 in: Mario Blaum, Patrick G. Farrell, Henk C. A. van Tilborg (editors). Information, coding and mathematics. Kluwer International Series in Engineering and Computer Science 687. Kluwer. MR 2005a:94003.

2003. Ernst M. Gabidulin, Alexei V. Ourivski. "Column scrambler for the GPT cryptosystem." Discrete Applied Mathematics 128, 207–221. MR 2004h:94044b. http://linkinghub.elsevier.com/retrieve/pii/S0166218X02004468 2001 version: "Modified GPT PKC with right scrambler." WCC 2001.

2004. Thierry P. Berger, Pierre Loidreau. "Designing an efficient and secure public-key cryptosystem based on reducible rank codes." Pages 218–229 in: Anne Canteaut, Kapalee Viswanathan (editors). Progress in Cryptology—INDOCRYPT 2004, 5th international conference on cryptology in India, Chennai, India, December 20–22, 2004, proceedings. Lecture Notes in Computer Science 3348. Springer ISBN 3-540-24130-2.

2005. Raphael Overbeck. "A new structural attack for GPT and variants." Pages 50–63 in: Ed Dawson, Serge Vaudenay (editors). Progress in cryptology—Mycrypt 2005. First international conference on cryptology in Malaysia, Kuala Lumpur, Malaysia, September 28–30, 2005, proceedings. Lecture Notes in Computer Science 3715. Springer. ISBN 978-3-540-28938-8. http://www.springerlink.com/index/bgkw4cp8pw4e98nb.pdf

2006. Raphael Overbeck. "Extending Gibson's attacks on the GPT cryptosystem." Pages 178–188 in: Oyvind Ytrehus, Coding and cryptography, revised selected papers from the international workshop (WCC 2005) held in Bergen, March 14–18, 2005. Lecture Notes in Computer Science 3969. Springer. ISBN 3-540-35481-6. MR 2428233. http://www.springerlink.com/index/x6242417m6064743.pdf

2006. Pierre Loidreau, Raphael Overbeck. "Decoding rank errors beyond the error-correction capability." Pages 168–190 in: Proceedings of the tenth international workshop on algebraic and combinatorial coding theory, ACCT-10, Zvenigorod, Russia, September 2006.

2008. Raphael Overbeck. "Structural attacks for public key cryptosystems based on Gabidulin codes." Journal of Cryptology 21, 280-­301. http://www.springerlink.com/index/H87H4332R25626VG.pdf

Public-key signatures and identification

1990. Marc Girault. "A (non-practical) three-pass identification protocol using coding theory." Pages 265–272 in: Jennifer Seberry, Josef Pieprzyk (editors). Advances in Cryptology–AUSCRYPT '90. Lecture Notes in Computer Science 453. Springer. ISBN 978-3-540-53000-8. http://www.springerlink.com/index/d210111m8n35173t.pdf

1990. Xinmei Wang. "Digital signature scheme based on error-correcting codes." Electronics Letters 26, 898–899.

1991. Yuanxing Li, Chuanjia Liang. "A digital signature scheme constructed with error-correcting codes." Chinese: Acta Electronica Sinica 19, 102–104. English: http://cryptome.org/nsa-nse/nsa-nse-06.pdf

1992. L. Harn, D. C. Wang. "Cryptanalysis and modification of digital signature scheme based on error-correcting codes." Electronics Letters 28, 157–159. http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=118942

1992. Mohssen Alabbadi, Stephen B. Wicker. "Security of Xinmei digital signature scheme." Electronics Letters 28, 890–891. http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=135156

1992. Mohssen Alabbadi, Stephen B. Wicker. "Cryptanalysis of the Harn and Wang modification of the Xinmei digital signature scheme." Electronics Letters 28, 1756–1758. http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=158577

1992. Johan van Tilburg. "Cryptanalysis of Xinmei digital signature scheme." Electronics Letters 28, 1935–1936. http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=161264

1993. Johan van Tilburg. "Cryptanalysis of the Alabbadi-Wicker digital signature scheme." Pages 114–119 in: Proceedings of fourteenth symposium on information theory in the Benelux.

1994. Jacques Stern. "A new identification scheme based on syndrome decoding." Pages 13–21 in: Douglas R. Stinson (editor). Advances in Cryptology—CRYPTO '93. 13th annual international cryptology conference, Santa Barbara, California, USA, August 22–26, 1993, proceedings. Lecture Notes in Computer Science 773. Springer. ISBN 3-540-57766-1. http://www.di.ens.fr/~stern/data/St47.ps

1994. Mohssen Alabbadi, Stephen B. Wicker. "Susceptibility of digital signature schemes based on error-correcting codes to universal forgery." MR 1318715. Pages 6–12 in: Andrew Chmora, Stephen B. Wicker (editors). Error control, cryptology, and speech compression. Selected papers from the Workshop on Information Protection held in Moscow, December 6–9, 1993. Lecture Notes in Computer Science 829. Springer. ISBN 3-540-58265-7. MR 95j:94003. http://www.springerlink.com/index/y0962687l834n006.pdf

1995. Mohssen Alabbadi, Stephen B. Wicker. "A digital signature scheme based on linear error-correcting block codes." MR 1376382. Pages 238–248 in: Josef Pieprzyk, Reihanah Safavi-Naini (editors). Advances in cryptology—ASIACRYPT '94. Proceedings of the Fourth International Conference held at the University of Wollongong, Wollongong, November 28–December 1, 1994. Lecture Notes in Computer Science 917. Springer. ISBN 3-540-59339-X. MR 96h:94002. http://www.springerlink.com/index/p77485775866266h.pdf Previous version: 1993. Mohssen Alabbadi, Stephen B. Wicker. "Digital signature scheme based on error-correcting codes."

1995. Jacques Stern. "Can one design a signature scheme based on error-correcting codes." Pages 424–426 in: Josef Pieprzyk, Reihanah Safavi-Naini (editors). Advances in cryptology—ASIACRYPT '94. Proceedings of the Fourth International Conference held at the University of Wollongong, Wollongong, November 28–December 1, 1994. Lecture Notes in Computer Science 917. Springer. ISBN 3-540-59339-X. MR 96h:94002.

1995. Pascal Véron. "Cryptanalysis of Harari's identification scheme." Pages 264–269 in: Colin Boyd (editor). Cryptography and Coding, 5th IMA conference, Cirencester, UK, December 18–20, 1995, proceedings. Lecture Notes in Computer Science 1025. Springer. ISBN 3-540-60693-9.

1996. Pascal Véron. "Improved identification schemes based on error-correcting codes." Applicable Algebra in Engineering, Communication and Computing 8, 57–69. MR 1465090.

1997. Gregory Kabatianskii, E. Krouk, Ben Smeets. "A digital signature scheme based on random error-correcting codes." MR 99h:94047. Pages 161–177 in: Michael Darnell (editor). Cryptography and coding. Proceedings of the 6th IMA International Conference held at the Royal Agricultural College, Cirencester, December 17–19, 1997. Lecture Notes in Computer Science 1355. Springer. IBSN 3-540-63927-6. MR 99g:94019.

1999. Sheng-Bo Xu, Jeroen Doumen. "An attack against the Alabbadi-Wicker scheme." In: The 20th symposium on information theory in the Benelux.

2001. Nicolas Courtois, Matthieu Finiasz, Nicolas Sendrier. "How to achieve a McEliece-based digital signature scheme." MR 2003h:94028. Pages 157–174 in: Colin Boyd (editor). Advances in cryptology—ASIACRYPT 2001. Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security held on the Gold Coast, December 9–13, 2001. Lecture Notes in Computer Science 2248, Springer. ISBN 3-540-42987-5. http://hal.inria.fr/docs/00/07/25/11/PDF/RR-4118.pdf

2003. Sheng-Bo Xu, Jeroen Doumen, Henk van Tilborg. "On the security of digital signature schemes based on error-correcting codes." Designs, Codes and Cryptography 28, 187–199. MR 2004c:94104.

2007. Philippe Gaborit, Marc Girault. "Lightweight code-based authentication and signature." In: IEEE international symposium on information theory, 2007. ISIT 2007. IEEE. http://www.unilim.fr/pages_perso/philippe.gaborit/isit_short_rev.pdf

2007. Pierre-Louis Cayrel, Ayoub Otmani, Damien Vergnaud. "On Kabatianskii-Krouk-Smeets signatures." Pages 237–251 in: International Workshop on the Arithmetic of Finite Fields, WAIFI 2007. Lecture Notes in Computer Science 4547, Springer. http://www.cayrel.net/IMG/pdf/waifi07-corrected.pdf

2007. Pierre-Louis Cayrel, Philippe Gaborit, Marc Girault. "Identity-based identification and signature schemes using correcting codes." Pages 69–78 in: Daniel Augot, Nicolas Sendrier, J.-P. Tillich (editors). WCC 2007. http://www.cayrel.net/IMG/pdf/wcc_ibi.pdf

2008. Carlos Aguilar Melchor, Pierre-Louis Cayrel, Philippe Gaborit. "A new efficient threshold ring signature scheme based on coding theory." Pages 1–16 in: Johannes Buchmann, Jintai Ding (editors). Post-quantum cryptography, second international workshop, PQCrypto 2008, Cincinnati, OH, USA, October 17–19, 2008, proceedings. Lecture Notes in Computer Science 5299, Springer. http://cayrel.net/IMG/pdf/pqcrypto.pdf

2008. Pierre-Louis Cayrel, Philippe Gaborit, Emmanuel Prouff. "Secure implementation of the Stern authentication and signature schemes for low-resource devices." Pages 191–205 in: G. Grimaud, F.-X. Standaert (editors). Eighth Smart Card Research and Advanced Application Conference: CARDIS 2008. Lecture Notes in Computer Science 5189, Springer. http://cayrel.net/IMG/pdf/CARDIS2008-SternAuthenticationScheme-CAYREL-GABORIT-PROUFF.pdf

Secret-key cryptography

1996. Jean-Bernard Fischer, Jacques Stern. "An efficient pseudo-random generator provably as secure as syndrome decoding." Pages 245–255 in: Ueli Maurer (editor). Advances in Cryptology—EUROCRYPT '96. International conference on the theory and application of cryptographic techniques, Saragossa, Spain, May 12–16, 1996, proceedings. Lecture Notes in Computer Science 1070. Springer. ISBN 978-3-540-61186-8. http://www.di.ens.fr/users/stern/data/St58.ps

2002. David Wagner. "A generalized birthday problem." Pages 288–303 in: Moti Yung (editor). Advances in Cryptology—CRYPTO 2002. 22nd annual international cryptology conference, Santa Barbara, California, USA, August 18–22, 2002, proceedings. Lecutre Notes in Computer Science 2442. Springer. ISBN 978-3-540-44050-5. http://www.springerlink.com/index/m9m479c7nac4r63j.pdf

2003. Daniel Augot, Matthieu Finiasz, Nicolas Sendrier. "A fast provably secure cryptographic hash function." http://eprint.iacr.org/2003/230.pdf

2005. Daniel Augot, Matthieu Finiasz, Nicolas Sendrier. "A family of fast syndrome based cryptographic hash functions." Pages 64–83 in: Ed Dawson, Serge Vaudenay (editors). Progress in cryptology—Mycrypt 2005. First international conference on cryptology in Malaysia, Kuala Lumpur, Malaysia, September 28–30, 2005, proceedings. Lecture Notes in Computer Science 3715. Springer. ISBN 978-3-540-28938-8. http://www.ecrypt.eu.org/stvl/hfw/Sendrier.pdf

2007. Philippe Gaborit, Cedric Laudaroux, Nicolas Sendrier. "SYND: a fast code-based stream cipher with a security reduction." Pages 186–190 in: Information theory, 2007. ISIT 2007. Proceedings. IEEE. http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4557224

2007. Matthieu Finiasz, Philippe Gaborit, Nicolas Sendrier "Improved fast syndrome based cryptographic hash functions." http://www-rocq.inria.fr/codes/Matthieu.Finiasz/research/2007/finiasz-gaborit-sendrier-ecrypt-hash-workshop07.pdf

Surveys

2002. Nicolas Sendrier. "Cryptosystèmes à clé publique basés sur les codes correcteurs d'erreurs." Mémoire d'habilitation à diriger des recherches, Université Paris 6.

2002. Nicolas Sendrier. "On the security of the McEliece public-key cryptosystem." MR 2005b:94039. Pages 141–163 in: Mario Blaum, Patrick G. Farrell, Henk C. A. van Tilborg (editors). Information, coding and mathematics. Kluwer International Series in Engineering and Computer Science 687. Kluwer. MR 2005a:94003.

2004. Matthieu Finiasz. "Nouvelles constructions utilisant des codes correcteurs d'erreurs en cryptographie à clef publique." Ph.D. thesis, École Polytechnique. http://www-rocq.inria.fr/codes/Matthieu.Finiasz/research/2004/finiasz-these.pdf

2007. Raphael Overbeck. "Public key cryptography based on coding theory." Ph.D. thesis, Darmstadt. http://tuprints.ulb.tu-darmstadt.de/epda/000823/.

2007. Lorenz Minder. "Cryptography based on error correcting codes." Ph.D. thesis, EPFL. http://library.epfl.ch/theses/?nr=3846.

2007. Daniela Engelbert, Raphael Overbeck, Arthur Schmidt. "A summary of McEliece-type cryptosystems and their security." Journal of Mathematical Cryptology 1, 151–199. MR 2008h:94056. Previous version: http://eprint.iacr.org/2006/162.

2008. Pierre-Louis Cayrel. "Construction et optimisation des cryptosystèmes basés sur les codes correcteurs d’erreurs." Ph.D. thesis, Université de Limoges. http://www.cayrel.net/spip.php?article135

2009. Raphael Overbeck, Nicolas Sendrier. "Code-based cryptography." Pages 95–145 in: Daniel J. Bernstein, Johannes Buchmann, Erik Dahmen (editors). Post-quantum cryptography. Springer, Berlin. ISBN 978-3-540-88701-0.

Version