Generating RSA Moduli with a Predetermined Portion
- 1 January 1998
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Multi-Agent Systems. Theories, Languages and ApplicationsPublished by Springer Nature ,1998
- The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone?Published by Springer Nature ,1996
- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits KnownPublished by Springer Nature ,1996
- A World Wide Number Field Sieve factoring record: On to 512 bitsPublished by Springer Nature ,1996
- Can D.S.A. be improved? — Complexity trade-offs with the digital signature standard —Published by Springer Nature ,1995
- The development of the number field sievePublished by Springer Nature ,1993
- Factoring Integers with Elliptic CurvesAnnals of Mathematics, 1987
- Discrete logarithms inGF(p)Algorithmica, 1986
- Modular Multiplication Without Trial DivisionMathematics of Computation, 1985
- A Method of Factoring and the Factorization of F 7Mathematics of Computation, 1975