scientific article; zbMATH DE number 1418285

MaRDI QIDQ4941845zbMATH OpenFDO

Authors Phong Q. Nguyen, Jacques Stern

Publication date 26 July 2000

zbMATH Keywords

discrete Fourier transformdiscrete-log-based protocolsefficient lattice-based attackgenerating randomly distributed pairshidden subset sum problemprecomputation schemespseudo-random generatorsecurity criterion

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Efficient cryptographic schemes provably as secure as subset sum
• Selected Areas in Cryptography
• The hardness of solving subset sum with preprocessing
• Playing ``hide-and-seek with numbers: the hidden number problem, lattices and exponential sums
• A polynomial-time algorithm for solving the hidden subset sum problem

Cited in

(15)

• On the distribution of the Diffie-Hellman pairs
• Koblitz curve cryptosystems
• A polynomial-time algorithm for solving the hidden subset sum problem
• Reusing nonces in Schnorr signatures (and keeping it secure...)
• On the smoothing parameter and last minimum of random orthogonal lattices
• Efficient cryptographic schemes provably as secure as subset sum
• On the uniformity of distribution of the RSA pairs
• Towards a provably secure DoS-resilient key exchange protocol with perfect forward secrecy
• scientific article; zbMATH DE number 1303528 (Why is no real title available?)
• Selected Areas in Cryptography
• Simultaneous diagonalization of incomplete matrices and applications
• The hardness of solving subset sum with preprocessing
• The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications
• New Results of Breaking the CLS Scheme from ACM-CCS 2014
• Channel allocation revisited through 1-extendability of graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941845)