Almost all primes can be quickly certified
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Two observations on probabilistic primality testing
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
Everything provable is provable in zero-knowledge
CRYPTO '88 Proceedings on Advances in cryptology
A family of Jacobians suitable for discrete log cryptosystems
CRYPTO '88 Proceedings on Advances in cryptology
Provably secure key-updating schemes in identity-based systems
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Approximating the number of zeroes of a GF[2] polynomial
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
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)
Verifying candidate matches in sparse and wildcard matching
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A formal framework for evaluating heuristic programs
Annals of Mathematics and Artificial Intelligence
Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On Quantum Computation with Some Restricted Amplitudes
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Constructing Elliptic Curve Cryptosystems in Characteristic 2
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Progress in computational complexity theory
Journal of Computer Science and Technology
Random self-reducibility and zero knowledge interactive proofs of possession of information
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Computationally private information retrieval with polylogarithmic communication
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
This paper is the first in a sequence of papers which will prove the existence of a random polynomial time algorithm for the set of primes. The techniques used are from arithmetic algebraic geometry and to a lesser extent algebraic and analytic number theory. The result complements the well known result of Strassen and Soloway that there exists a random polynomial time algorithm for the set of composites.