Lest we remember: cold-boot attacks on encryption keys
Contrary to widespread assumption, dynamic RAM (DRAM), the main memory in most
modern computers, retains its contents for several seconds after power is lost, even at room …
modern computers, retains its contents for several seconds after power is lost, even at room …
Malware guard extension: Using SGX to conceal cache attacks
In modern computer systems, user processes are isolated from each other by the operating
system and the hardware. Additionally, in a cloud scenario it is crucial that the hypervisor …
system and the hardware. Additionally, in a cloud scenario it is crucial that the hypervisor …
CacheBleed: a timing attack on OpenSSL constant-time RSA
The scatter–gather technique is a commonly implemented approach to prevent cache-based
timing attacks. In this paper, we show that scatter–gather is not constant time. We implement …
timing attacks. In this paper, we show that scatter–gather is not constant time. We implement …
The return of coppersmith's attack: Practical factorization of widely used RSA moduli
We report on our discovery of an algorithmic flaw in the construction of primes for RSA key
generation in a widely-used library of a major manufacturer of cryptographic hardware. The …
generation in a widely-used library of a major manufacturer of cryptographic hardware. The …
Medusa: Microarchitectural data leakage via automated attack synthesis
In May 2019, a new class of transient execution attack based on Meltdown called
microarchitectural data sampling (MDS), was disclosed. MDS enables adversaries to leak …
microarchitectural data sampling (MDS), was disclosed. MDS enables adversaries to leak …
[PDF][PDF] New RSA vulnerabilities using lattice reduction methods.
A May - 2003 - Citeseer
New RSA Vulnerabilities Using Lattice Reduction Methods Page 1 New RSA Vulnerabilities
Using Lattice Reduction Methods Dissertation Thesis by Alexander May October 19, 2003 Page …
Using Lattice Reduction Methods Dissertation Thesis by Alexander May October 19, 2003 Page …
A strategy for finding roots of multivariate polynomials with new applications in attacking RSA variants
E Jochemsz, A May - Advances in Cryptology–ASIACRYPT 2006: 12th …, 2006 - Springer
We describe a strategy for finding small modular and integer roots of multivariate
polynomials using lattice-based Coppersmith techniques. Applying our strategy, we obtain …
polynomials using lattice-based Coppersmith techniques. Applying our strategy, we obtain …
[BOOK][B] Cryptanalysis of RSA and its variants
MJ Hinek - 2009 - taylorfrancis.com
Thirty years after RSA was first publicized, it remains an active research area. Although
several good surveys exist, they are either slightly outdated or only focus on one type of …
several good surveys exist, they are either slightly outdated or only focus on one type of …
Cache-timing attacks on RSA key generation
During the last decade, constant-time cryptographic software has quickly transitioned from
an academic construct to a concrete security requirement for real-world libraries. Most of …
an academic construct to a concrete security requirement for real-world libraries. Most of …
Using LLL-reduction for solving RSA and factorization problems
A May - The LLL Algorithm: Survey and Applications, 2009 - Springer
Twenty five years ago, Lenstra, Lenstra and Lovász presented their celebrated LLL lattice
reduction algorithm. Among the various applications of the LLL algorithm is a method due to …
reduction algorithm. Among the various applications of the LLL algorithm is a method due to …