An efficient solution of the congruencex^2 + ky^2 = mpmod{n}
- 1 September 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 33 (5), 702-709
- https://doi.org/10.1109/tit.1987.1057350
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number FieldsPublished by Springer Science and Business Media LLC ,2000
- Efficient Signature Schemes Based on Polynomial Equations (preliminary version)Published by Springer Science and Business Media LLC ,2000
- Solving bivariate quadratic congruences in random polynomial timeMathematics of Computation, 1987
- An efficient signature scheme based on quadratic equationsPublished by Association for Computing Machinery (ACM) ,1984
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- Worst-case complexity bounds for algorithms in the theory of integral quadratic formsJournal of Algorithms, 1980
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- On taking roots in finite fieldsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977
- New directions in cryptographyIEEE Transactions on Information Theory, 1976