Elliptic curve lightweight cryptography: A survey

CA Lara-Nino, A Diaz-Perez… - IEEE Access, 2018 - ieeexplore.ieee.org
Since it was invented in 1986, elliptic curve cryptography (ECC) has been studied widely in
industry and academy from different perspectives. Some of these aspects include …

LadderLeak: Breaking ECDSA with less than one bit of nonce leakage

DF Aranha, FR Novaes, A Takahashi… - Proceedings of the …, 2020 - dl.acm.org
Although it is one of the most popular signature schemes today, ECDSA presents a number
of implementation pitfalls, in particular due to the very sensitive nature of the random value …

EC-crypto: Highly efficient area-delay optimized elliptic curve cryptography processor

K Javeed, A El-Moursy, D Gregg - IEEE Access, 2023 - ieeexplore.ieee.org
Elliptic Curve Cryptography (ECC) based security protocols require much shorter key space
which makes ECC the most suitable option for resource-limited devices as compared to the …

Selecting elliptic curves for cryptography: an efficiency and security analysis

JW Bos, C Costello, P Longa, M Naehrig - Journal of Cryptographic …, 2016 - Springer
We select a set of elliptic curves for cryptography and analyze our selection from a
performance and security perspective. This analysis complements recent curve proposals …

Space-efficient and noise-robust quantum factoring

S Ragavan, V Vaikuntanathan - Annual International Cryptology …, 2024 - Springer
We provide two improvements to Regev's quantum factoring algorithm (arXiv: 2308.06572),
addressing its space efficiency and its noise-tolerance. Our first contribution is to improve the …

Efficient and secure ECDSA algorithm and its applications: A survey

M Al-Zubaidie, Z Zhang, J Zhang - arXiv preprint arXiv:1902.10313, 2019 - arxiv.org
Public-key cryptography algorithms, especially elliptic curve cryptography (ECC) and elliptic
curve digital signature algorithm (ECDSA) have been attracting attention from many …

[PDF][PDF] Optimizing Space in Regev's Factoring Algorithm.

S Ragavan, V Vaikuntanathan - IACR Cryptol. ePrint Arch., 2023 - iacr.steepath.eu
We improve the space efficiency of Regev's quantum factoring algorithm [Reg23] while
keeping the circuit size the same. Our main result constructs a quantum factoring circuit …

Lightweight architecture for elliptic curve scalar multiplication over prime field

Y Hao, S Zhong, M Ma, R Jiang, S Huang, J Zhang… - Electronics, 2022 - mdpi.com
In this paper, we present a novel lightweight elliptic curve scalar multiplication architecture
for random Weierstrass curves over prime field F p. The elliptic curve scalar multiplication is …

The Montgomery ladder on binary elliptic curves

T Oliveira, J López, F Rodríguez-Henríquez - Journal of Cryptographic …, 2018 - Springer
In this survey paper, we present a careful analysis of the Montgomery ladder procedure
applied to the computation of the constant-time point multiplication operation on elliptic …

Fast and regular algorithms for scalar multiplication over elliptic curves

M Rivain - Cryptology ePrint Archive, 2011 - eprint.iacr.org
Elliptic curve cryptosystems are more and more widespread in everyday-life applications.
This trend should still gain momentum in coming years thanks to the exponential security …