Security of most significant bits of g^x^2.
From MaRDI portal
Publication:1853041
Recommendations
- scientific article; zbMATH DE number 3954815
- Security of the most significant bits of the Shamir message passing scheme
- On the bit security of cryptographic primitives
- scientific article; zbMATH DE number 2081144
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
- On Cryptographically Significant Mappings over GF(2 n )
- scientific article; zbMATH DE number 1588479
- On the bit security of the Diffie-Hellman key
- Security of polynomial transformations of the Diffie-Hellman key.
- Bit security of the hyperelliptic curves Diffie-Hellman problem
Cites work
- A sieve algorithm for the shortest lattice vector problem
- Character sums with exponential functions
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
- scientific article; zbMATH DE number 1588478 (Why is no real title available?)
- scientific article; zbMATH DE number 1588479 (Why is no real title available?)
- scientific article; zbMATH DE number 1339097 (Why is no real title available?)
- scientific article; zbMATH DE number 1852139 (Why is no real title available?)
- scientific article; zbMATH DE number 6472645 (Why is no real title available?)
- scientific article; zbMATH DE number 3091928 (Why is no real title available?)
- On a new exponential sum
- Security of the most significant bits of the Shamir message passing scheme
- The insecurity of the elliptic curve digital signature algorithm with partially known nonces
- The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
Cited in
(10)- Security of polynomial transformations of the Diffie-Hellman key.
- On the complexity of the discrete logarithm and Diffie-Hellman problems
- scientific article; zbMATH DE number 1588479 (Why is no real title available?)
- Security of the most significant bits of the Shamir message passing scheme
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
- scientific article; zbMATH DE number 3954815 (Why is no real title available?)
- On the bit security of the weak Diffie-Hellman problem
- Finding significant Fourier coefficients: clarifications, simplifications, applications and limitations
- Public Key Cryptography – PKC 2004
- On the statistical properties of Diffie-Hellman distributions
This page was built for publication: Security of most significant bits of \(g^{x^{2}}\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853041)
