Paper 2023/1137
A New Sieving Approach for Solving the HNP with One Bit of Nonce by Using Built-in Modulo Arithmetic
Abstract
The Hidden Number Problem (HNP) has been extensively used in the side-channel attacks against (EC)DSA and Diffie-Hellman. The lattice approach is a primary method of solving the HNP. In EUROCRYPT 2021, Albrecht and Heninger constructed a new lattice to solve the HNP, which converts the HNP to the SVP. After that, their approach became the state-of-the-art lattice method of solving the HNP. But Albrecht and Heninger's approach has a high failure rate for solving the HNP with one bit of nonce (
Note: This manuscript was once submitted in February, 2023, and it will be improved sooner.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint.
- Keywords
- Hidden Number Problem (HNP)latticesieving algorithmmodulo arithmetic
- Contact author(s)
-
sunyao @ iie ac cn
changshuai751x @ iie ac cn - History
- 2023-07-24: approved
- 2023-07-22: received
- See all versions
- Short URL
- https://ia.cr/2023/1137
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/1137, author = {Yao Sun and Shuai Chang}, title = {A New Sieving Approach for Solving the {HNP} with One Bit of Nonce by Using Built-in Modulo Arithmetic}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/1137}, year = {2023}, url = {https://eprint.iacr.org/2023/1137} }