Primes in quadratic unique factorization domains
From MaRDI portal
(Redirected from Publication:301417)
Recommendations
- An analogue of the Solovay-Strassen test in quadratic Euclidean rings
- scientific article; zbMATH DE number 5590087
- Recognizing primes
- The Miller-Rabin algorithm
- Four primality testing algorithms
- scientific article; zbMATH DE number 1588470
- scientific article; zbMATH DE number 4103163
- Practic zero-knowledge proofs: Giving hints and using deficiencies
- scientific article; zbMATH DE number 4168790
- Cyclotomic-quadratic fields.
Cites work
- scientific article; zbMATH DE number 4025567 (Why is no real title available?)
- scientific article; zbMATH DE number 682387 (Why is no real title available?)
- A method for obtaining digital signatures and public-key cryptosystems
- Binary quadratic forms. An algorithmic approach
- Cryptanalysis of short RSA secret exponents
- Euclidean Quadratic Fields
- Introduction to theoretical and numerical methods in cryptography
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
- Shortest division chains in unique factorization domains
Cited in
(8)- scientific article; zbMATH DE number 7760912 (Why is no real title available?)
- Polynomial algorithms for primality testing in algebraic number fieldswith class number 1
- scientific article; zbMATH DE number 2149952 (Why is no real title available?)
- RSA cryptosystem for Dedekind rings
- scientific article; zbMATH DE number 7136179 (Why is no real title available?)
- An analogue of the Solovay-Strassen test in quadratic Euclidean rings
- Euclid Prime Sequences over Unique Factorization Domains
- Analogue of the RSA-cryptosystem in quadratic unique factorization domains
This page was built for publication: Primes in quadratic unique factorization domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301417)