The hardness of the hidden subset sum problem and its cryptographic implications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1666, Issue , 1999, Pages 31-46

  Nguyen, Phong ^a   Stern, Jacques ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE FOURIER TRANSFORMS; HARDNESS; SET THEORY; SMART CARDS;

IDENTIFICATION SCHEME; PARTICULAR CONDITION; PSEUDORANDOM GENERATORS; RANDOMLY DISTRIBUTED; SECURITY CRITERION; SMART CARD IMPLEMENTATION; SUBSET SUM PROBLEMS; UNIFORM DISTRIBUTION;

CRYPTOGRAPHY;

EID: 84957072857     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48405-1_3     Document Type: Conference Paper

References (21)

1. M. Ajtai. Generating hard instances of lattice problems. In Proc. 28th ACM STOC, pages 99-108, 1996. Extended version at http://www.eccc.uni-trier.de/eccc/.
2. V. Boyko, M. Peinado, and R. Venkatesan. Speeding up discrete log and factoring based schemes via precomputations. In Proc. of Eurocrypt' 98, volume 1403 of LNCS, pages 221-235. Springer-Verlag, 1998.
3. E. Brickell, D.M. Gordon, K.S. McCurley, and D. Wilson. Fast exponentiation with precomputation. In Proc. of Eurocrypt'92, volume 658 of Lecture Notes in Computer Science, pages 200-207. Springer-Verlag, 1993.
4. E. F. Brickell and K. S. McCurley. An interactive identi_cation scheme based on discrete logarithms and factoring. Journal of Cryptology, 5(1):29-39, 1992.
5. M.J. Coster, A. Joux, B.A. LaMacchia, A.M. Odlyzko, C.-P. Schnorr, and J. Stern. Improved low-density subset sum algorithms. Computational Complexity, 2:111-128, 1992.
6. P. de Rooij. On the security of the Schnorr scheme using preprocessing. In Proc. Of Eurocrypt'91, volume 547 of LNCS, pages 71-80. Springer-Verlag, 1991.
7. P. de Rooij. Efficient exponentiation using precomputation and vector addition chains. In Proc. of Eurocrypt'94, volume 950 of Lecture Notes in Computer Science, pages 389-399. Springer-Verlag, 1995.
8. P. de Rooij. On Schnorr's preprocessing for digital signature schemes. Journal of Cryptology, 10(1):1-16, 1997.
9. T. El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory, 31:469-472, 1985.
10. R. Impagliazzo and M. Naor. Efficient cryptographic schemes provably as secure as subset sum. Journal of Cryptology, 9(4):199-216, 1996.
11. A. K. Lenstra, H. W. Lenstra, and L. Lovfiasz. Factoring polynomials with rational coeficients. Math. Ann., 261:515-534, 1982.
12. C.H. Lim and P.J. Lee. More flexible exponentiation with precomputation. In Proc. of Crypto'94, volume 839 of Lecture Notes in Computer Science, pages 95-107. Springer-Verlag, 1994.
13. National Institute of Standards and Technology (NIST). FIPS Publication 186: Digital Signature Standard, May 1994.
14. P. Nguyen and J. Stern. Merkle-Hellman revisited: a cryptanalysis of the Qu-Vanstone cryptosystem based on group factorizations. In Proc. of Crypto'97, volume 1294 of LNCS, pages 198-212. Springer-Verlag, 1997.
15. P. Nguyen and J. Stern. Cryptanalysis of a fast public key cryptosystem presented at SAC '97. In Proc. of SAC '98, LNCS. Springer-Verlag, 1998.
16. P. Nguyen and J. Stern. The Béguin-Quisquater server-aided RSA protocol from Crypto '95 is not secure. In Proc. of Asiacrypt '98, volume 1514 of LNCS, pages 372-379. Springer-Verlag, 1998.
17. C.-P. Schnorr. A hierarchy of polynomial lattice basis reduction algorithms. The-oretical Computer Science, 53:201-224, 1987.
18. C.P. Schnorr. Efficient identification and signatures for smart cards. In Proc. Of Crypto'89, volume 435, pages 239-252. Springer-Verlag, 1990.
19. C.P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4:161-174, 1991.
20. C.P. Schnorr and H.H. Hörner. Attacking the Chor-Rivest cryptosystem by improved lattice reduction. In Proc. of Eurocrypt'95, volume 921 of LNCS, pages 12. Springer-Verlag, 1995.
21. V. Shoup. Number Theory C++ Library (NTL) version 3.6. Can be obtained at http://www.shoup.net/ntl/.