Two issues in public key cryptography: RSA bit security and a new knapsack type system
Two issues in public key cryptography: RSA bit security and a new knapsack type system
Algorithmica
Solving sparse linear equations over finite fields
IEEE Transactions on Information Theory
The quadratic sieve factoring algorithm
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Discrete logarithms in finite fields and their cryptographic significance
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Reductions among number theoretic problems
Information and Computation
An M3 public-key encryption scheme
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Trapdoor rings and their use in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
An efficient solution of the congruence x2+ky2=m (modn)
IEEE Transactions on Information Theory
How to generate factored random numbers
SIAM Journal on Computing - Special issue on cryptography
Some remarks on computing the square parts of integers
Information and Computation
A key-exchange system based on imaginary quadratic fields
Journal of Cryptology
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
A Family of Jacobians Suitable for Discrete Log Cryptosystems
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Discrete Logarithms and Factoring
Discrete Logarithms and Factoring
Fast and rigorous factorization under the generalized Riemann hypothesis
Fast and rigorous factorization under the generalized Riemann hypothesis
ACM SIGSAM Bulletin
A subexponential algorithm for the discrete logarithm problem with applications to cryptography
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
An application of higher reciprocity to computational number theory
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
A robust and verifiable cryptographically secure election scheme
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Riemann's hypothesis and tests for primality
Journal of Computer and System Sciences
| Hi-index | 0.00 |
This paper surveys computational problems related to integer factorization and the calculation of discrete logarithms in various groups. Its aim is to provide theory sufficient for the derivation of heuristic running time estimates, and at the same time introduce algorithms of practical value.