Partial Bits Exposure Attacks on a New Commitment Scheme Based on the Zagier Polynomial

DOI10.1007/978-3-319-54705-3_22zbMath1404.94124OpenAlexW2592995724MaRDI QIDQ2980866

Li-Ping Wang, Xiaona Zhang

Publication date: 5 May 2017

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-54705-3_22

zbMATH Keywords

latticesLLL algorithmbivariate polynomialsCoppersmith's methodcryptographic commitmentscollision-resistant

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (max. 100)

Bivariate polynomial injections and elliptic curves ⋮ Commitment schemes and diophantine equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Finding a Small Root of a Univariate Modular Equation
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• Bivariate Polynomials Modulo Composites and Their Applications
• Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
• Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
• The Knowledge Complexity of Interactive Proof Systems
• Financial Cryptography

This page was built for publication: Partial Bits Exposure Attacks on a New Commitment Scheme Based on the Zagier Polynomial