Solving HNP with One Bit Leakage: An Asymmetric Lattice Sieving Algorithm
The Hidden Number Problem (HNP) was introduced by Boneh and Venkastesan to analyze the bit-security of the Diffie–Hellman key exchange scheme. It is often used to mount a side-channel attack on (EC)DSA. The hardness of HNP is mainly determined by the number of nonce leakage bits and the size of the...
Main Authors: | Wenhao Shi, Haodong Jiang, Zhi Ma |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-12-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/25/1/49 |
Similar Items
-
Blind-Folded: Simple Power Analysis Attacks using Data with a Single Trace and no Training
by: Xunyue Hu, et al.
Published: (2024-12-01) -
Constant time lattice reduction in dimension 4 with application to SQIsign
by: Otto Hanyecz, et al.
Published: (2025-03-01) -
Undetectable secret key recovery for the ECDSA digital signature algorithm
by: A. V. Kovalev, et al.
Published: (2010-09-01) -
Quantile: Quantifying Information Leakage
by: Vedad Hadžic, et al.
Published: (2023-12-01) -
Test sieves
by: 8096 British Standards Institution