Random small Hamming weight products with applications to cryptography

Discrete Applied Mathematics

Volumn 130, Issue 1, 2003, Pages 37-49

  Hoffstein, Jeffrey ^a,b   Silverman, Joseph H ^a  

^a NTRU Cryptosystems Inc   (United States)

^b BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES;

HAMMING WEIGHT;

CRYPTOGRAPHY;

EID: 0041967528     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00588-7     Document Type: Conference Paper

References (13)

1. H. Cohen, A Course in Computational Number Theory, Vol. GTM 138, Springer, Berlin, 1993.
2. Coppersmith D., Seroussi G. On the minimum distance of some quadratic residue codes. IEEE Trans. Inform. Theory. IT-30(2):1984;407-411.
3. Gordon D. A survey of fast exponentiation methods. J. Algorithms. 27:1998;129-146.
4. D. Hankerson, J.L. Hernandez, A. Menezes, Software implementation of elliptic curve cryptography over binary fields, in: Ç. Koç, C. Paar (Eds.), Cryptographic Hardware and Embedded Systems (CHES 2000), Lecture Notes in Computer Science, Vol. 1965, Springer, Berlin, 2001.
5. Hoffstein J., Pipher J., Silverman J.H. NTRU: a new high speed public key cryptosystem. Buhler J.P. Algorithmic Number Theory (ANTS III), Portland, OR, June 1998. Lecture Notes in Computer Science. Vol. 1423:1998;267-288 Springer, Berlin.
6. D. Knuth, The Art of Computer Programming, Seminumerical Algorithms, Vol. 2, 3rd Edn., Addison-Wesley, Reading, MA, 1998.
7. C.H. Lim, P.J. Lee, Sparse RSA keys and their generation, preprint, 2000.
8. Menezes A.J., van Oorschot P.C., Vanstone S.A. Handbook of Applied Cryptography. 1997;CRC, Boca Raton, FL.
9. de Rooij P. On the security of the Schnorr scheme using preprocessing. Damgard I.B. Advances in Cryptology (Eurocrypt 90), Aarhus, Denmark, May 1990. Lecture Notes in Computer Science. Vol. 473:1990;71-80 Springer, Berlin.
10. Schnorr C.P. Efficient identification and signatures for smart cards. Brassard G. Advances in Cryptology (Crypto 89), Santa Barbara, CA, August 1989. Lecture Notes in Computer Science. Vol. 435:1989;239-252 Springer, Berlin.
11. Solinas J. Efficient arithmetic on Koblitz curves. Designs Codes Cryptogr. 19:2000;195-249.
12. Stinson D. Cryptography: Theory and Practice. 1997;CRC, Boca Raton, FL.
13. Stinson D.R. Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem. Math. Comput. 71:2002;379-391.