Biased nonce sense: Lattice attacks against weak ECDSA signatures in cryptocurrencies
J Breitner, N Heninger - Financial Cryptography and Data Security: 23rd …, 2019 - Springer
In this paper, we compute hundreds of Bitcoin private keys and dozens of Ethereum, Ripple,
SSH, and HTTPS private keys by carrying out cryptanalytic attacks against digital signatures …
SSH, and HTTPS private keys by carrying out cryptanalytic attacks against digital signatures …
Raccoon Attack: Finding and Exploiting {Most-Significant-Bit-Oracles} in {TLS-DH (E})
Diffie-Hellman key exchange (DHKE) is a widely adopted method for exchanging
cryptographic key material in real-world protocols like TLS-DH (E). Past attacks on TLS-DH …
cryptographic key material in real-world protocols like TLS-DH (E). Past attacks on TLS-DH …
Pseudorandom functions: Three decades later
A Bogdanov, A Rosen - Tutorials on the Foundations of Cryptography …, 2017 - Springer
Abstract In 1984, Goldreich, Goldwasser and Micali formalized the concept of
pseudorandom functions and proposed a construction based on any length-doubling …
pseudorandom functions and proposed a construction based on any length-doubling …
Du-vote: Remote electronic voting with untrusted computers
Du-Vote is a new remote electronic voting protocol that eliminates the often-required
assumption that voters trust general-purpose computers. Trust is distributed in Du-Vote …
assumption that voters trust general-purpose computers. Trust is distributed in Du-Vote …
[PDF][PDF] Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions.
A Akavia - COLT, 2010 - people.csail.mit.edu
Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions Page 1
Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions Adi Akavia∗ …
Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions Adi Akavia∗ …
Pre-and post-quantum Diffie–Hellman from groups, actions, and isogenies
B Smith - Arithmetic of Finite Fields: 7th International Workshop …, 2018 - Springer
Diffie–Hellman key exchange is at the foundations of public-key cryptography, but
conventional group-based Diffie–Hellman is vulnerable to Shor's quantum algorithm. A …
conventional group-based Diffie–Hellman is vulnerable to Shor's quantum algorithm. A …
A multiscale sub-linear time Fourier algorithm for noisy data
A Christlieb, D Lawlor, Y Wang - Applied and Computational Harmonic …, 2016 - Elsevier
We extend the recent sparse Fourier transform algorithm of [1] to the noisy setting, in which a
signal of bandwidth N is given as a superposition of k≪ N frequencies and additive random …
signal of bandwidth N is given as a superposition of k≪ N frequencies and additive random …
An efficient quantum algorithm for lattice problems achieving subexponential approximation factor
L Eldar, S Hallgren - arXiv preprint arXiv:2201.13450, 2022 - arxiv.org
We give a quantum algorithm for solving the Bounded Distance Decoding (BDD) problem
with a subexponential approximation factor on a class of integer lattices. The quantum …
with a subexponential approximation factor on a class of integer lattices. The quantum …
Improving bounds on elliptic curve hidden number problem for ECDH key exchange
J Xu, S Sarkar, H Wang, L Hu - … Conference on the Theory and Application …, 2022 - Springer
Abstract Elliptic Curve Hidden Number Problem (EC-HNP) was first introduced by Boneh,
Halevi and Howgrave-Graham at Asiacrypt 2001. To rigorously assess the bit security of the …
Halevi and Howgrave-Graham at Asiacrypt 2001. To rigorously assess the bit security of the …
Deterministic sparse Fourier approximation via approximating arithmetic progressions
A Akavia - IEEE Transactions on Information Theory, 2013 - ieeexplore.ieee.org
We present a deterministic algorithm for finding the significant Fourier frequencies of a given
signal f∈ CN and their approximate Fourier coefficients in running time and sample …
signal f∈ CN and their approximate Fourier coefficients in running time and sample …