scientific article; zbMATH DE number 3912454
zbMATH Open0572.10001MaRDI QIDQ3689236FDOQ3689236
Authors: Eric Bach 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
algorithmscomplexitycryptographycomputational number theoryprimality testingcomposite numbersstrong pseudoprimespreassigned factoring pattern
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Power residues, reciprocity (11A15) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Primes (11A41) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Primality (11Y11) Computational number theory (11Yxx)
Cited In (17)
- On the effectiveness of a generalization of Miller's primality theorem
- A fast and robust RNS algorithm for evaluating signs of determinants
- Solving dense subset-sum problems by using analytical number theory
- Generalized strong pseudoprime tests and applications
- Comments on search procedures for primitive roots
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field
- Generating random factored ideals in number fields
- Title not available (Why is that?)
- The least quadratic non-residue
- Short effective intervals containing primes
- Efficient oblivious transfer from lossy threshold homomorphic encryption
- A generalization of Miller’s primality theorem
- Isogeny problems with level structure
- Primality testing
- On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number
- Realistic analysis of some randomized algorithms
- Explicit Bounds for Primality Testing and Related Problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3689236)
