Public-key cryptosystems from lattice reduction problems

This publication has 15 references indexed in Scilit:

• An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
  Published by Springer Nature ,2000
• The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
  Journal of Computer and System Sciences, 1997
• A public-key cryptosystem with worst-case/average-case equivalence
  Published by Association for Computing Machinery (ACM) ,1997
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
  SIAM Journal on Computing, 1988
• Algorithmic Geometry of Numbers
  Annual Review of Computer Science, 1987
• On Lovász’ lattice reduction and the nearest lattice point problem
  Combinatorica, 1986
• A public key cryptosystem and a signature scheme based on discrete logarithms
  IEEE Transactions on Information Theory, 1985
• Probabilistic encryption
  Journal of Computer and System Sciences, 1984
• Factoring polynomials with rational coefficients
  Mathematische Annalen, 1982
• New directions in cryptography
  IEEE Transactions on Information Theory, 1976