Compositeness test with nodal curves
From MaRDI portal
Publication:3174870
Recommendations
- Combinatorial aspects of nodal curves
- Divisibilities among nodal curves
- Hypothesis testing under composite functions alternative
- scientific article; zbMATH DE number 3911471
- Testing the equivalence of planar curves
- Nodal curves and polarizations with good properties
- Modular curves of composite level
- Testing holomorphy on curves
- On nodal plane curves
Cites work
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- scientific article; zbMATH DE number 1258344 (Why is no real title available?)
- scientific article; zbMATH DE number 1748084 (Why is no real title available?)
- scientific article; zbMATH DE number 2206373 (Why is no real title available?)
- A hyperelliptic smoothness test. I
- A method for obtaining digital signatures and public-key cryptosystems
- Advanced Topics in Computional Number Theory
- Algorithmic Number Theory
- Computing Square Roots in Finite Fields
- Computing in the Jacobian of a Hyperelliptic Curve
- Elliptic Curve Cryptosystems
- Elliptic Curves and Primality Proving
- Elliptic curves. Number theory and cryptography
- Factoring integers with elliptic curves
- Finding strong pseudoprimes to several bases. II
- Four primality testing algorithms
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Hyperelliptic cryptosystems
- On Strong Pseudoprimes to Several Bases
- On distinguishing prime numbers from composite numbers
- PRIMES is in P
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
- The Pseudoprimes to 25 ⋅10 9
This page was built for publication: Compositeness test with nodal curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174870)
