On Bounded Distance Decoding with Predicate: Breaking the “Lattice Barrier” for the Hidden Number Problem

Author(s):  
Martin R. Albrecht ◽  
Nadia Heninger
2019 ◽  
Vol 88 (2) ◽  
pp. 341-361
Author(s):  
Jun Xu ◽  
Lei Hu ◽  
Santanu Sarkar

2012 ◽  
Vol 47 (4) ◽  
pp. 358-367 ◽  
Author(s):  
San Ling ◽  
Igor E. Shparlinski ◽  
Ron Steinfeld ◽  
Huaxiong Wang

Author(s):  
Keegan Ryan

Side channels have long been recognized as a threat to the security of cryptographic applications. Implementations can unintentionally leak secret information through many channels, such as microarchitectural state changes in processors, changes in power consumption, or electromagnetic radiation. As a result of these threats, many implementations have been hardened to defend against these attacks. Despite these mitigations, this work presents a novel side-channel attack against ECDSA and DSA. The attack targets a common implementation pattern that is found in many cryptographic libraries. In fact, about half of the libraries that were tested exhibited the vulnerable pattern. This pattern is exploited in a full proof of concept attack against OpenSSL, demonstrating that it is possible to extract a 256-bit ECDSA private key using a simple cache attack after observing only a few thousand signatures. The target of this attack is a previously unexplored part of (EC)DSA signature generation, which explains why mitigations are lacking and the issue is so widespread. Finally, estimates are provided for the minimum number of signatures needed to perform the attack, and countermeasures are suggested to protect against this attack.


Sign in / Sign up

Export Citation Format

Share Document