A one-parameter quadratic-base version of the Baillie–PSW probable prime test

by Zhenxiang Zhang
Venue:Math. Comp
Citations:2 - 0 self

Active Bibliography

Article electronically published on February 17, 2000 FINDING STRONG PSEUDOPRIMES TO SEVERAL BASES – Zhenxiang Zhang
861 Applied Cryptography -- Protocols, Algorithms, and . . . – Bruce Schneier
869 A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks – Shafi Goldwasser, Silvio Micali, Ronald L. Rivest - 1995
1923 Randomized Algorithms – Rajeev Motwani - 1995
941 Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer – Peter W. Shor - 1997
3188 A Method for Obtaining Digital Signatures and Public-Key Cryptosystems – R.L. Rivest, A. Shamir, L. Adleman - 1978
428 Simulating Physics with Computers – Richard Feynman, Peter W. Shor - 1982
1 Finding strong pseudoprimes to several bases. II,Math – Zhenxiang Zhang, Min Tang
313 Efficient algorithms for pairing-based cryptosystems – Paulo S. L. M. Barreto, Hae Y. Kim, Ben Lynn, Michael Scott - 2002