Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation
- 18 May 2001
- book chapter
- Published by Springer Nature
- p. 281-293
- https://doi.org/10.1007/3-540-46416-6_24
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Lattice basis reduction: Improved practical algorithms and solving subset sum problemsPublished by Springer Nature ,1991
- A more efficient algorithm for lattice basis reductionJournal of Algorithms, 1988
- Minkowski's Convex Body Theorem and Integer ProgrammingMathematics of Operations Research, 1987
- A hierarchy of polynomial time lattice basis reduction algorithmsTheoretical Computer Science, 1987
- On a problem of Oppenheim concerning “factorisatio numerorum”Journal of Number Theory, 1983
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982