scientific article; zbMATH DE number 3912454
From MaRDI portal
Publication:3689236
algorithmscomplexitycomposite numberscomputational number theorycryptographypreassigned factoring patternprimality testingstrong pseudoprimes
Research exposition (monographs, survey articles) pertaining to number theory (11-02) Power residues, reciprocity (11A15) Primes (11A41) Factorization (11Y05) Primality (11Y11) Number-theoretic algorithms; complexity (11Y16) Computational number theory (11Yxx) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)
Recommendations
Cited in
(18)- Solving dense subset-sum problems by using analytical number theory
- Generalized strong pseudoprime tests and applications
- A fast and robust RNS algorithm for evaluating signs of determinants
- Short effective intervals containing primes
- Realistic analysis of some randomized algorithms
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field
- Explicit Bounds for Primality Testing and Related Problems
- A generalization of Miller’s primality theorem
- On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number
- Comments on search procedures for primitive roots
- Generating random factored ideals in number fields
- Efficient oblivious transfer from lossy threshold homomorphic encryption
- The least quadratic non-residue
- scientific article; zbMATH DE number 5590087 (Why is no real title available?)
- Primality testing
- Isogeny problems with level structure
- The counting function for Elkies primes
- On the effectiveness of a generalization of Miller's primality theorem
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)
