Riemann's Hypothesis and tests for primality
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Two observations on probabilistic primality testing
Proceedings on Advances in cryptology---CRYPTO '86
Intractable problems in number theory (invited talk)
CRYPTO '88 Proceedings on Advances in cryptology
Regular Article: On search, decision, and the efficiency of polynomial-time algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Distributed Cooperation During the Absence of Communication
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
The Complexity of Computing the Size of an Interval
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On Testing for Zero Polynomials by a Set of Points with Bounded Precision
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Improved Online/Offline Signature Schemes
CRYPTO '01 Proceedings of the 21st 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
A Switching Closure Test to Analyze Cryptosystems
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Remark on the Threshold RSA Signature Scheme
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Models of Computation, Riemann Hypothesis, and Classical Mathematics
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Traitor Tracing with Constant Transmission Rate
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Primality Tests and Use of Primes in Public-Key Systems
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
Primality and Identity Testing via Chinese Remaindering
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On the Implementation of a Fast Prime Generation Algorithm
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
A Timing-Resistant Elliptic Curve Backdoor in RSA
Information Security and Cryptology
Realizing Hash-and-Sign Signatures under Standard Assumptions
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Chosen-Ciphertext Secure RSA-Type Cryptosystems
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Efficient Publicly Verifiable Secret Sharing with Correctness, Soundness and ZK Privacy
Information Security Applications
On the effectiveness of a generalization of Miller's primality theorem
Journal of Complexity
Algorithms and theory of computation handbook
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Remote data checking using provable data possession
ACM Transactions on Information and System Security (TISSEC)
On constructing 1-1 one-way functions
Studies in complexity and cryptography
Primality tests based on fermat's little theorem
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Efficient Attributes for Anonymous Credentials
ACM Transactions on Information and System Security (TISSEC) - Special Issue on Computer and Communications Security
New signature schemes with coupons and tight reduction
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Automorphisms of finite rings and applications to complexity of problems
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
New key generation algorithms for the XTR cryptosytem
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part I
Algorithmic randomness, quantum physics, and incompleteness
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Probabilistic analyses on finding optimal combinations of primality tests in real applications
ISPEC'05 Proceedings of the First international conference on Information Security Practice and Experience
The circuit model of quantum computation and its simulation with mathematica
MMCP'11 Proceedings of the 2011 international conference on Mathematical Modeling and Computational Science
Efficient multiple-collision trapdoor hash family
Security and Communication Networks
On the instantiability of hash-and-sign RSA signatures
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Partial key exposure on RSA with private exponents larger than N
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Parallel computation skeletons with premature termination property
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Cryptanalysis of server-aided RSA key generation protocols at MADNES 2005
ATC'07 Proceedings of the 4th international conference on Autonomic and Trusted Computing
Secure hierarchical identity-based identification without random oracles
ISC'12 Proceedings of the 15th international conference on Information Security
Estimating parallel performance
Journal of Parallel and Distributed Computing
Security pitfalls of an efficient threshold proxy signature scheme for mobile agents
Information Processing Letters
| Hi-index | 0.00 |
In this paper we present two algorithms for testing primality of an integer. The first algorithm runs in 0(n^1^/^7) steps; while, the second runs in 0(log^4n) step but assumes the Extended Riemann Hypothesis. We also show that a class of functions which includes the Euler phi function are computationally equivalent to factoring integers.