Security of the most significant bits of the Shamir message passing scheme

DOI10.1090/S0025-5718-01-01358-8zbMath1021.11032OpenAlexW1969351387MaRDI QIDQ2759102

María Isabel González Vasco, Igor E. Shparlinski

Publication date: 10 December 2001

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-01-01358-8

zbMATH Keywords

exponential sumsbit securityShamir message passing scheme

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Exponential sums (11T23) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation ⋮ On the bit security of the weak Diffie-Hellman problem ⋮ Security of polynomial transformations of the Diffie-Hellman key. ⋮ Security of most significant bits of \(g^{x^{2}}\).

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hierarchy of polynomial time lattice basis reduction algorithms
• Factoring polynomials with rational coefficients
• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
• Quasi-Monte Carlo methods and pseudo-random numbers
• ON THE DISTRIBUTION OF DIGITS IN PERIODIC FRACTIONS

This page was built for publication: Security of the most significant bits of the Shamir message passing scheme