Isotropic quadratic forms, Diophantine equations and digital signatures, \texttt{DEFIv2}
From MaRDI portal
Publication:7319787
Cites work
- A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
- Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
- scientific article; zbMATH DE number 4213909 (Why is no real title available?)
- scientific article; zbMATH DE number 4070803 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3300651 (Why is no real title available?)
- On the Computational Complexity of Determining the Solvability or Unsolvability of the Equation X 2 - DY 2 = -1
This page was built for publication: Isotropic quadratic forms, Diophantine equations and digital signatures, \texttt{DEFIv2}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7319787)