An efficient solution of the congruence<tex>x^2 + ky^2 = mpmod{n}</tex>

DOI10.1109/TIT.1987.1057350zbMath0636.94008OpenAlexW1983378843MaRDI QIDQ3777935

J. M. Pollard, Claus Peter Schnorr

Publication date: 1987

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1987.1057350

zbMATH Keywords

probabilistic algorithmquadratic equationsignature scheme

Mathematics Subject Classification ID

Cryptography (94A60) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (10)

Efficient solution of rational conics ⋮ The security of the birational permutation signature schemes ⋮ Zero-knowledge proofs of identity ⋮ A security analysis of uniformly-layered Rainbow defined over non-commutative rings ⋮ Spreading alerts quietly and the subgroup escape problem ⋮ On the number of solutions of the equation \(Rx^2 + Sy^2\equiv 1\pmod N\) ⋮ Security of a new digital signature scheme based on factoring and discrete logarithms ⋮ Identification and signatures based on NP-hard problems of indefinite quadratic forms ⋮ A Security Analysis of Uniformly-Layered Rainbow ⋮ Signature scheme using the root extraction problem on quaternions

This page was built for publication: An efficient solution of the congruence&lt;tex&gt;x^2 + ky^2 = mpmod{n}&lt;/tex&gt;