Riemann's hypothesis and tests for primality
From MaRDI portal
Publication:1235011
DOI10.1016/S0022-0000(76)80043-8zbMath0349.68025WikidataQ55969660 ScholiaQ55969660MaRDI QIDQ1235011
Publication date: 1976
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Primality (11Y11)
Related Items
The Power of Leibniz-Like Functions as Oracles, An unambiguous class possessing a complete set, Hidden multiscale order in the primes, The challenge of computer mathematics, A RECURSIVE FORMULA CONCERNING THE GREATEST PRIME NUMBER LESS THAN OR EQUAL TO AN ODD NUMBER n, The geometry of Bayesian programming, Indivisibility of the class number of a real abelian field of prime conductor, Certifying giant nonprimes, New Characterization of the Factor Refinement Algorithm with Applications, Breaking SIDH in polynomial time, On some algebraic ways to calculate zeros of the Riemann zeta function, TIDE: a novel approach to constructing timed-release encryption, Applications of timed-release encryption with implicit authentication, Factorization, malleability and equivalent problems, Interactions of computational complexity theory and mathematics, Notes on some new kinds of pseudoprimes, Primality testing, Identifying supersingular elliptic curves, Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy, A lower bound for primality, SYLOW p-PSEUDOPRIMES TO SEVERAL BASES FOR SEVERAL PRIMES p, Unnamed Item, The computational complexity of recognizing permutation functions, Two algorithms to find primes in patterns, Multiparty generation of an RSA modulus, Multiparty generation of an RSA modulus, Tautologies with a unique Craig interpolant, uniform vs. nonuniform complexity, Breaking RSA may be as difficult as factoring, A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers, Relative class number of imaginary Abelian fields of prime conductor below 10000, Efficient algorithms for NMR quantum computers with small qubits, Some Observations on Primality Testing, Reductions among number theoretic problems, On search, decision, and the efficiency of polynomial-time algorithms, Primes in quadratic unique factorization domains, Compositeness test with nodal curves, Fast generation of prime numbers and secure public-key cryptographic parameters., Application of Parallel Virtual Machine Framework to the Strong Prime Problem, Optimal ancilla-free Pauli+V circuits for axial rotations, Computation of prime numbers by using a probabilistic algorithm, A deterministic algorithm for the discrete logarithm problem in a semigroup, Primality testing of large numbers in Maple, Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes, A key distribution system equivalent to factoring, Some remarks on computing the square parts of integers, The generation of random numbers that are probably prime, A survey of one-way functions in complexity theory, Asymptotically Fast Factorization of Integers, Lucas Pseudoprimes, Machines that perform measurements, Probabilistic algorithm for testing primality, A signature scheme from the finite field isomorphism problem, Algorithms for the Multiplication Table Problem, On testing for zero polynomials by a set of points with bounded precision., On completely factoring any integer efficiently in a single run of an order-finding algorithm, Discrete extremal problems, Classifying the computational complexity of problems, A new linear programming algorithm - better or worse than the simplex method?, On oracle factoring of integers, A generalization of Miller’s primality theorem, An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach, Recent developments in primality testing, Finding strong pseudoprimes to several bases, An extension of a result about divisors in a residue class and its application to reducing integer factorization to computing Euler’s totient, Some observations on the probabilistic algorithms and NP-hard problems, Knottedness is in NP, modulo GRH, NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA, A time-luck tradeoff in relativized cryptography, Determining periodicity: a case study of a functional specification, Semi-algebraic properties of Minkowski sums of a twisted cubic segment, Statistical Evidence for Small Generating Sets, A heuristic irreducibility test for univariate polynomials, The structure factor of primes, Strong polynomial-time reducibility, A semideterministic approach to object creation and nondeterminism in database queries, On taking square roots without quadratic nonresidues over finite fields, The error probability of the Miller-Rabin primality test, Self-witnessing polynomial-time complexity and prime factorization, Finding 𝐶₃-strong pseudoprimes, A faster pseudo-primality test, On the effectiveness of a generalization of Miller's primality theorem, Common modulus attacks on small private exponent RSA and some fast variants (in practice), Fail-stop blind signature scheme based on the integer factorization, A deterministic version of Pollard’s $p-1$ algorithm, Some remarks concerning the M.I.T. public-key cryptosystem, Two kinds of strong pseudoprimes up to $10^{36}$, A relation between correctness and randomness in the computation of probabilistic algorithms, On computing ord\(_{N}(2)\) and its application, Integer factoring and compositeness witnesses, Finding strong pseudoprimes to several bases. II, Realistic analysis of some randomized algorithms, Graph theory (algorithmic, algebraic, and metric problems), A new construction of threshold cryptosystems based on RSA, A framework for deterministic primality proving using elliptic curves with complex multiplication, NP-complete decision problems for binary quadratics, Explicit Bounds for Primality Testing and Related Problems, The Riemann hypothesis in computer science, Miller's primality test, Graph isomorphism, general remarks, Quantum computation and quantum information†, Complexity of inverting the Euler function, Smale’s 17th problem: Average polynomial time to compute affine and projective solutions, Quantum algorithms for computing general discrete logarithms and orders with tradeoffs, Realizing Hash-and-Sign Signatures under Standard Assumptions, A note on monte carlo primality tests and algorithmic information theory, On Constructing 1-1 One-Way Functions, A note on Rabin's probabilistic primality test, Sequences of numbers generated by addition in formal groups and new primality and factorization tests, On the number of primality witnesses of composite integers, Non-standard finite fields over \(I\Delta_0+\Omega_1\), Factoring with Cyclotomic Polynomials, Generalized strong pseudoprime tests and applications, Primality Test Via Quantum Factorization, Note on class number parity of an abelian field of prime conductor, Quantum model of computations: Underlying principles and achievements, Strong pseudoprimes to base 2, Complexity questions in number theory, Optimal information retrieval when queries are not random, On some natural complete operators, Security pitfalls of an efficient threshold proxy signature scheme for mobile agents, Identifying half-twists using randomized algorithm methods., Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes, Computing in general Abelian groups is hard, Primality testing with fewer random bits, A one-parameter quadratic-base version of the Baillie-PSW probable prime test, Short effective intervals containing primes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Topics in multiplicative number theory
- Fast multiplication of large numbers
- The least quadratic non residue
- The distribution of quadratic residues and non‐residues
- On Character Sums and Primitive Roots†
- On Character Sums and L-Series†
- Every Prime Has a Succinct Certificate
- An Algorithm for Testing the Primality of any Integer
