An efficient solution of the congruence<tex>x^2 + ky^2 = mpmod{n}</tex>
From MaRDI portal
Publication:3777935
DOI10.1109/TIT.1987.1057350zbMATH Open0636.94008OpenAlexW1983378843MaRDI QIDQ3777935FDOQ3777935
Authors: 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
Recommendations
Cited In (16)
- Title not available (Why is that?)
- Solving Bivariate Quadratic Congruences in Random Polynomial Time
- Signature scheme using the root extraction problem on quaternions
- Efficient solution of rational conics
- The security of the birational permutation signature schemes
- A security analysis of uniformly-layered Rainbow defined over non-commutative rings
- Zero-knowledge proofs of identity
- Identification and signatures based on NP-hard problems of indefinite quadratic forms
- Spreading alerts quietly and the subgroup escape problem
- A security analysis of uniformly-layered Rainbow. Revisiting Sato-Araki's non-commutative approach to Ong-Schnorr-Shamir signature towards postquantum paradigm
- Title not available (Why is that?)
- Signatures through approximate representations by quadratic forms
- Security of a new digital signature scheme based on factoring and discrete logarithms
- Efficient solution of \(A x^{(k)}= b^{(k)}\) using \(A^{ - 1}\)
- Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields
- On the number of solutions of the equation \(Rx^2 + Sy^2\equiv 1\pmod N\)
This page was built for publication: An efficient solution of the congruence<tex>x^2 + ky^2 = mpmod{n}</tex>
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777935)