An efficient solution of the congruence<tex>x^2 + ky^2 = mpmod{n}</tex>
From MaRDI portal
Publication:3777935
Recommendations
Cited in
(16)- Signatures through approximate representations by quadratic forms
- scientific article; zbMATH DE number 3912273 (Why is no real title available?)
- A security analysis of uniformly-layered Rainbow defined over non-commutative rings
- On the number of solutions of the equation \(Rx^2 + Sy^2\equiv 1\pmod N\)
- Spreading alerts quietly and the subgroup escape problem
- Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields
- Zero-knowledge proofs of identity
- Signature scheme using the root extraction problem on quaternions
- Identification and signatures based on NP-hard problems of indefinite quadratic forms
- Security of a new digital signature scheme based on factoring and discrete logarithms
- scientific article; zbMATH DE number 7069720 (Why is no real title available?)
- Solving Bivariate Quadratic Congruences in Random Polynomial Time
- Efficient solution of rational conics
- A security analysis of uniformly-layered Rainbow. Revisiting Sato-Araki's non-commutative approach to Ong-Schnorr-Shamir signature towards postquantum paradigm
- Efficient solution of \(A x^{(k)}= b^{(k)}\) using \(A^{ - 1}\)
- The security of the birational permutation signature schemes
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)