scientific article
From MaRDI portal
Publication:3689236
zbMath0572.10001MaRDI QIDQ3689236
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityalgorithmscryptographycomputational number theoryprimality testingcomposite numbersstrong pseudoprimespreassigned factoring pattern
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Power residues, reciprocity (11A15) Primes (11A41) Factorization (11Y05) Primality (11Y11) Computational number theory (11Yxx)
Related Items (14)
The least quadratic non-residue ⋮ Computing the endomorphism ring of an ordinary elliptic curve over a finite field ⋮ A generalization of Miller’s primality theorem ⋮ Generating random factored ideals in number fields ⋮ Comments on search procedures for primitive roots ⋮ On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number ⋮ Primality testing ⋮ On the effectiveness of a generalization of Miller's primality theorem ⋮ Realistic analysis of some randomized algorithms ⋮ Explicit Bounds for Primality Testing and Related Problems ⋮ Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption ⋮ Generalized strong pseudoprime tests and applications ⋮ A fast and robust RNS algorithm for evaluating signs of determinants ⋮ Short effective intervals containing primes
This page was built for publication:
