论文信息 - The Magic Words Are Squeamish Ossifrage (Extended Abstract) - 字舞流文

The Magic Words Are Squeamish Ossifrage (Extended Abstract)

Arjen K. Lenstra | Paul C. Leyland | A. K. Lenstra | P. Leyland | AbstractDerek Atkins | Michael Gra | M. Gra | AbstractDerek Atkins

[1] Mike Gardner. A new kind of cipher that would take millions of years to break , 1997 .

[2] Arjen K. Lenstra,et al. Lattice sieving and trial division , 1994, ANTS.

[3] Arjen K. Lenstra,et al. Factoring Integers Using SIMD Sieves , 1994, EUROCRYPT.

[4] Arjen K. Lenstra,et al. On the Factorization of RSA-120 , 1993, CRYPTO.

[5] Arjen K. Lenstra. Massively Parallel Computing and Factoring , 1992, LATIN.

[6] Jeffrey W. Smith,et al. Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes , 1992, Exp. Math..

[7] Andrew M. Odlyzko,et al. Computation of discrete logarithms in prime fields , 1991, Des. Codes Cryptogr..

[8] Arjen K. Lenstra,et al. Algorithms in Number Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[9] Arjen K. Lenstra,et al. Factoring With Two Large Primes , 1990, EUROCRYPT.

[10] Arjen K. Lenstra,et al. Factoring by Electronic Mail , 1990, EUROCRYPT.

[11] Robert D. Silverman. The multiple polynomial quadratic sieve , 1987 .

[12] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[13] J. Dixon. Asymptotically fast factorization of integers , 1981 .