Deterministic and Las Vegas Primality Testing Algorithms
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Some consequences of the existence of pseudorandom generators
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Realistic analysis of some randomized algorithms
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Recognizing primes in random polynomial time
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Zero-knowledge simulation of Boolean circuits
Proceedings on Advances in cryptology---CRYPTO '86
How to share a secret with cheaters
Proceedings on Advances in cryptology---CRYPTO '86
Two infinite sets of primes with fast primality tests
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
An improved Las Vegas primality test
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Everything provable is provable in zero-knowledge
CRYPTO '88 Proceedings on Advances in cryptology
Distributed primality proving and the primality of (23539+1)/3
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Easy numbers for the elliptic curve primality proving algorithm
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
The computational complexity of recognizing permutation functions
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Primality testing using elliptic curves
Journal of the ACM (JACM)
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
The State of Elliptic Curve Cryptography
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
2-round zero knowledge and proof auditors
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Verifying candidate matches in sparse and wildcard matching
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Constructing Elliptic Curve Cryptosystems in Characteristic 2
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
CM-Curves with Good Cryptographic Properties
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Algorithms
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Fast Generation of Provable Primes Using Search in Arithmetic Progressions
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
ACM Transactions on Algorithms (TALG)
Building cyclic elliptic curves modulo large primes
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Counting the number of points on elliptic curves over finite fields: strategies and performances
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Computationally private information retrieval with polylogarithmic communication
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Primality proving with elliptic curves
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Automorphisms of finite rings and applications to complexity of problems
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |