Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
Discrete logarithm
OpenAlex ID:
C173259116
Algorithms for quantum computation: discrete logarithms and factoring
2002
·
P.W. Shor
·
Annual Symposium on Foundations of Computer Science
·
9,631
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
1997
·
Peter W. Shor
·
SIAM Journal on Computing
·
9,399
PDF
A public key cryptosystem and a signature scheme based on discrete logarithms
1985
·
T. Elgamal
·
IEEE Transactions on Information Theory
·
8,171
Elliptic Curve Cryptosystems
1987
·
Neal Koblitz
·
Mathematics of Computation
·
5,772
PDF
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
1999
·
Peter W. Shor
·
SIAM Review
·
4,120
Efficient signature generation by smart cards
1991
·
C. P. Schnorr
·
Journal of Cryptology
·
2,840
PDF
The Elliptic Curve Digital Signature Algorithm (ECDSA)
2001
·
Don Johnson
, Alfred Menezes
, et al.
·
International Journal of Information Security
·
2,356
Security Arguments for Digital Signatures and Blind Signatures
2000
·
David Pointcheval
, Jacques Stern
·
Journal of Cryptology
·
2,249
PDF
Quantum measurements and the Abelian Stabilizer Problem
1995
·
Kitaev, A. Yu.
·
arXiv (Cornell University)
·
1,861
PDF
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
2007
·
Taher ElGamal
·
Springer eBooks
·
1,667
Efficient Fully Homomorphic Encryption from (Standard) LWE
2011
·
Zvika Brakerski
, Vinod Vaikuntanathan
·
Annual Symposium on Foundations of Computer Science
·
1,507
Efficient Identification and Signatures for Smart Cards
2007
·
C. P. Schnorr
·
Springer eBooks
·
1,443
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
1984
·
Manuel Blum
, Silvio Micali
·
SIAM Journal on Computing
·
1,332
Lower Bounds for Discrete Logarithms and Related Problems
1997
·
Victor Shoup
·
Lecture notes in computer science
·
1,284
PDF
Bulletproofs: Short Proofs for Confidential Transactions and More
2018
·
Benedikt Bunz
, Jonathan Bootle
, et al.
·
IEEE Symposium on Security and Privacy (S&P)
·
1,254
PDF
An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
1978
·
S. Pohlig
, M. Hellman
·
IEEE Transactions on Information Theory
·
1,216
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
2021
·
Craig Gidney
, Martin Ekerå
·
Quantum
·
1,127
PDF
A One Round Protocol for Tripartite Diffie–Hellman
2000
·
Antoine Joux
·
Lecture notes in computer science
·
1,081
Reducing elliptic curve logarithms to logarithms in a finite field
1993
·
A.J. Menezes
, T. Okamoto
, et al.
·
IEEE Transactions on Information Theory
·
1,046
Signature Schemes and Anonymous Credentials from Bilinear Maps
2004
·
Jan Camenisch
, Anna Lysyanskaya
·
Lecture notes in computer science
·
1,022
A secure and efficient conference key distribution system
1995
·
Mike Burmester
, Yvo Desmedt
·
Lecture notes in computer science
·
854
Selecting Cryptographic Key Sizes
2001
·
Arjen K. Lenstra
, Eric R. Verheul
·
Journal of Cryptology
·
821
PDF
Efficient Identification and Signatures for Smart Cards
2007
·
C. P. Schnorr
·
Springer eBooks
·
758
PDF
Candidate Multilinear Maps from Ideal Lattices
2013
·
Sanjam Garg
, Craig Gentry
, et al.
·
Lecture notes in computer science
·
755
The State of Elliptic Curve Cryptography
2000
·
Neal Koblitz
, Alfred Menezes
, et al.
·
Designs Codes and Cryptography
·
726
Show more works
View as search
Works count:
7,977
Citation count:
147,500
Year
Topic
Type
