Some applications of coding theory in cryptography

• A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication

[1]  Irving S. Reed,et al.  A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.

[2]  Wieb Bosma,et al.  Algorithmic Number Theory , 2000, Lecture Notes in Computer Science.

[3]  M. Alabbadi,et al.  Susceptibility of digital signature schemes based on error-correcting codes to universal forgery , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[4]  Ilya Dumer,et al.  Suboptimal decoding of linear codes: partition technique , 1996, IEEE Trans. Inf. Theory.

[5]  D. Stinson,et al.  Resilient functions and large sets of orthogonal arrays , 2022 .

[6]  Neal Koblitz.  Almost Primality of Group Orders of Elliptic Curves Defined over Small Finite Fields , 2001, Exp. Math..

[7]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[8]  Alexander Barg.  A large family of sequences with low periodic correlation , 1997, Discret. Math..

[9]  P. Delsarte.  Bounds for unrestricted codes, by linear programming , 1972 .

[10]  Henning Stichtenoth,et al.  Algebraic function fields and codes , 1993, Universitext.

[11]  P. Kocher,et al.  Differential power analysis, advances in cryptology-CRYPTO'99 , 1999 .

[12]  James L. Massey,et al.  Minimal Codewords and Secret Sharing , 1999 .

[13]  Jeroen Doumen,et al.  On the Security of Digital Signature Schemes Based on Error-Correcting Codes , 2003, Des. Codes Cryptogr..

[14]  T. R. N. Rao,et al.  Private-key algebraic-code encryptions , 1989, IEEE Trans. Inf. Theory.

[15]  Eli Biham,et al.  Differential Fault Analysis of Secret Key Cryptosystems , 1997, CRYPTO.

[16]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[17]  Igor E. Shparlinski,et al.  On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields , 2000, ANTS.

[18]  Eli Biham,et al.  Differential Cryptanalysis of the Data Encryption Standard , 1993, Springer New York.

[19]  J. van Tilburg,et al.  Security-analysis of a class of cryptosystems based on linear error-correcting codes , 1994 .

[20]  J. van Tilburg.  Cryptanalysis of Xinmei digital signature scheme , 1992 .

[21]  José Felipe Voloch,et al.  Euclidean weights of codes from elliptic curves over rings , 2000 .

[22]  Stephen B. Wicker,et al.  Susceptibility of Digital Signature Schemes Based on Error-Correcting Codes to Universal Forgery , 1993, Error Control, Cryptology, and Speech Compression.

[23]  Jon Grantham,et al.  Frobenius pseudoprimes , 2001, Math. Comput..

[24]  Tatsuaki Okamoto,et al.  How to Enhance the Security of Public-Key Encryption at Minimum Cost , 1999, Public Key Cryptography.

[25]  Daniel Bleichenbacher,et al.  Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1 , 1998, CRYPTO.

[26]  Robert J. McEliece,et al.  A public key cryptosystem based on algebraic coding theory , 1978 .

[27]  Gregory A. Kabatiansky,et al.  A Digital Signature Scheme Based on Random Error-Correcting Codes , 1997, IMACC.

[28]  R. J. McEliece,et al.  On sharing secrets and Reed-Solomon codes , 1981, CACM.

[29]  Edwin L. Key,et al.  An analysis of the structure and complexity of nonlinear binary sequence generators , 1976, IEEE Trans. Inf. Theory.

[30]  Douglas R. Stinson,et al.  An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions , 2004, Journal of Cryptology.

[31]  G. R. Blakley,et al.  Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[32]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[33]  Stephen B. Wicker,et al.  Security of Xinmei digital signature scheme , 1992 .

[34]  Eric R. Verheul,et al.  Sloppy Alice attacks! Adaptive chosen ciphertext attacks on the McEliece cryptosystem , 2002 .

[35]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[36]  Taher El Gamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.

[37]  Jacques Stern,et al.  A New Identification Scheme Based on Syndrome Decoding , 1993, CRYPTO.

[38]  Gilles Brassard,et al.  Privacy Amplification by Public Discussion , 1988, SIAM J. Comput..

[39]  Elwyn R. Berlekamp,et al.  On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[40]  Wang Xin-mei,et al.  Digital signature scheme based on error-correcting codes , 1990 .

[41]  Claus-Peter Schnorr,et al.  On the Construction of Random Number Generators and Random Function Generators , 1988, EUROCRYPT.

[42]  David M. Bressoud.  Factorization and Primality Testing , 1989 .

[43]  Florent Chabaud,et al.  On the Security of Some Cryptosystems Based on Error-correcting Codes , 1994, EUROCRYPT.

[44]  Marc Perret.  Multiplicative character sums and non linear geometric codes , 1990, EUROCODE.

[45]  Stephen B. Wicker,et al.  A Digital Signature Scheme Based on Linear Error-correcting Block Codes , 1994, ASIACRYPT.

[46]  Pht Peter Beelen.  Algebraic geometry and coding theory , 2001 .

[47]  P. Ribenboim.  The new book of prime number records , 1996 .

[48]  S. Wagstaff.  Divisors of Mersenne numbers , 1983 .

[49]  Guang Gong,et al.  Elliptic Curve Pseudorandom Sequence Generators , 1999, Selected Areas in Cryptography.

[50]  D. Kahn.  The codebreakers : the story of secret writing , 1968 .

[51]  Simon Litsyn,et al.  On the accuracy of the binomial approximation to the distance distribution of codes , 1995, IEEE Trans. Inf. Theory.

[52]  Oded Goldreich,et al.  The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[53]  Sean Hallgren,et al.  Linear Congruential Generators Over Elliptic Curves , 2001 .

[54]  Henk C. A. van Tilborg.  Error-correcting codes : a first course , 1993 .

[55]  Paul C. Kocher,et al.  Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems , 1996, CRYPTO.

[56]  Thomas A. Berson,et al.  Failure of the McEliece Public-Key Cryptosystem Under Message-Resend and Related-Message Attack , 1997, CRYPTO.

[57]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[58]  James R. C. Leitzel,et al.  Algebraic function fields with small class number , 1975 .

[59]  Shu Lin,et al.  An approximation to the weight distribution of binary linear codes , 1985, IEEE Trans. Inf. Theory.

[60]  Alexander Barg,et al.  On the complexity of minimum distance decoding of long linear codes , 1999, IEEE Trans. Inf. Theory.

[61]  Joan Daemen,et al.  AES Proposal : Rijndael , 1998 .

[62]  Bruce Schneier,et al.  Reaction Attacks against several Public-Key Cryptosystems , 1999, ICICS.

[63]  Anne Canteaut,et al.  Cryptanalysis of the Original McEliece Cryptosystem , 1998, ASIACRYPT.

[64]  Silvio Micali,et al.  Why and how to establish a private code on a public network , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[65]  Mitsuru Matsui,et al.  Linear Cryptanalysis Method for DES Cipher , 1994, EUROCRYPT.

[66]  Jean-Marie Goethals,et al.  Nearly perfect binary codes , 1972, Discret. Math..

[67]  Ueli Maurer,et al.  Local randomness in pseudorandom sequences , 2004, Journal of Cryptology.

[68]  David A. Cox.  Primes of the Form x2 + ny2: Fermat, Class Field Theory, and Complex Multiplication , 1989 .

[69]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[70]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[71]  Richard J. Lipton,et al.  On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract) , 1997, EUROCRYPT.