Encryption Schemes

[1]  Stephen C. Pohlig,et al.  An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance , 2022, IEEE Trans. Inf. Theory.

[2]  Victor Shoup,et al.  A Composition Theorem for Universal One-Way Hash Functions , 2000, EUROCRYPT.

[3]  Ronald Cramer,et al.  A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack , 1998, CRYPTO.

[4]  J. Shallit,et al.  Algorithmic number theory , 1996 .

[5]  Chin-Chen Chang,et al.  Authenticated encryption scheme without using a one way function , 1995 .

[6]  Rainer A. Rueppel,et al.  Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem , 1996, Des. Codes Cryptogr..

[7]  C. Pomerance,et al.  There are infinitely many Carmichael numbers , 1994 .

[8]  Daniel R. Simon,et al.  Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack , 1991, CRYPTO.

[9]  Moni Naor,et al.  Public-key cryptosystems provably secure against chosen ciphertext attacks , 1990, STOC '90.

[10]  Eric Bach,et al.  How to Generate Factored Random Numbers , 1988, SIAM J. Comput..

[11]  René C. Peralta,et al.  A simple and fast probabilistic algorithm for computing square roots modulo a prime number , 1986, IEEE Trans. Inf. Theory.

[12]  Carl Pomerance,et al.  The Quadratic Sieve Factoring Algorithm , 1985, EUROCRYPT.

[13]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[14]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[15]  Loo Keng Hua,et al.  Introduction to number theory , 1982 .

[16]  M. Rabin.  Probabilistic algorithm for testing primality , 1980 .

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

[18]  Volker Strassen,et al.  A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..

[19]  N. Jacobson,et al.  Basic Algebra I , 1976 .

[20]  Vaughan R. Pratt,et al.  Every Prime has a Succinct Certificate , 1975, SIAM J. Comput..

[21]  Gary L. Miller,et al.  Riemann's Hypothesis and tests for primality , 1975, STOC.

[22]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[23]  Oded Goldreich,et al.  Foundations of Cryptography: Basic Tools , 2000 .

[24]  Mihir Bellare,et al.  Optimal Asymmetric Encryption-How to Encrypt with RSA , 1995 .

[25]  W. Leveque.  Fundamentals of number theory , 1977 .

[26]  T. Apostol.  Introduction to analytic number theory , 1976 .

[27]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[28]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[29]  C. A. Rogers,et al.  An Introduction to the Geometry of Numbers , 1959 .