24 citations · 24 across the 2 of their papers we have counts for
5 papers
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic +3
We report on two new records: the factorization of RSA-240, a 795-bit number, and a discrete logarithm computation over a 795-bit prime field. Previous records were the factorizati…
CopyCat: Controlled Instruction-Level Attacks on Enclaves
Daniel Moghimi, Jo Van Bulck, Nadia Heninger +2
The adversarial model presented by trusted execution environments (TEEs) has prompted researchers to investigate unusual attack vectors. One particularly powerful class of controll…
TPM-FAIL: TPM meets Timing and Lattice Attacks
Daniel Moghimi, Berk Sunar, Thomas Eisenbarth +1
Trusted Platform Module (TPM) serves as a hardware-based root of trust that protects cryptographic keys from privileged system and physical adversaries. In this work, we perform a…
Properties of Constacyclic Codes Under the Schur Product
Brett Hemenway Falk, Nadia Heninger, Michael Rudow
For a subspace of a vector space of dimension , the Schur-product space for is defined to be the span of all vectors formed by…
Cryptographic applications of capacity theory: On the optimality of Coppersmith's method for univariate polynomials
Ted Chinburg, Brett Hemenway, Nadia Heninger +1
We draw a new connection between Coppersmith's method for finding small solutions to polynomial congruences modulo integers and the capacity theory of adelic subsets of algebraic c…