Author:
Adleman Leonard M.,McCurley Kevin S.
Publisher
Springer Berlin Heidelberg
Reference157 articles.
1. Leonard M. Adleman and Jonathan DeMarrais. A subexponential algorithm for discrete logarithms over all finite fields. In Douglas R. Stinson, editor, Advances in Cryptology: Crypto '93, volume 773 of Lecture Notes in Computer Science, pages 147–158, New York, 1993. Springer-Verlag.
2. Leonard M. Adleman and Jonathan DeMarrais. A subexponential algorithm for discrete logarithms over all finite fields. Mathematics of Computation, 61:1–15, 1993. Extended abstract in [AD93a].
3. Leonard M. Adleman. Factoring numbers using singular integers. In Proceedings of the 23th Annual Symposium on Theory of Computing, pages 64–71, 1991.
4. Leonard M. Adleman. The function field sieve. In Proceedings of the 1994 Algorithmic Number Theory Symposium, Lecture Notes in Computer Science. Springer-Verlag, to appear.
5. Leonard M. Adleman, Dennis Estes, and Kevin S. McCurley. Solving bivariate quadratic congruences in random polynomial time. Mathematics of Computation, 48:17–28, 1987.
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The One-Wayness of Jacobi Signatures;Lecture Notes in Computer Science;2024
2. Deterministic factoring with oracles;Applicable Algebra in Engineering, Communication and Computing;2021-09-16
3. The Power of Leibniz-Like Functions as Oracles;Computer Science – Theory and Applications;2020
4. Detection of Primes in the Set of Residues of Divisors of a Given Number;Number-Theoretic Methods in Cryptology;2018
5. Factoring n and the Number of Points of Kummer Hypersurfaces mod n;Number-Theoretic Methods in Cryptology;2018