Open problems in number theoretic complexity, II

1994/01/01 by Leonard M. Adleman, Kevin S. McCurley · 1 citation
Computer Science · Mathematics · #Analytic Number Theory Research #Computability, Logic, AI Algorithms #semigroups and automata theory

paper · doi:10.1007/3-540-58691-1_70

crossref issued 1994/01/01 · crossref published 1994/01/01 · crossref published-print 1994/01/01 · openalex publication_date 1994/01/01 · crossref published-online 2005/06/04 · crossref created 2012/02/26 · crossref deposited 2021/12/31 · openalex created_date 2025/10/10 · crossref indexed 2026/01/20 · openalex updated_date 2026/07/29

Citations

• Elliptic curve cryptosystems
• Computational Complexity of Probabilistic Turing Machines
• Reducing elliptic curve logarithms to logarithms in a finite field
• Factoring polynomials with rational coefficients
• New directions in cryptography
• Probabilistic encryption
• A method for obtaining digital signatures and public-key cryptosystems

Cited by

• Firoozbakht's conjecture [wikipedia]