Paper 2024/1861 Original: eprint.iacr.org/2024/1861 ↗
Another Lattice Attack Against an RSA-like Cryptosystem
Abstract
Let $N=pq$ be the product of two balanced prime numbers $p$ and $q$. In 2015, Roman'kov introduced an interesting RSA-like cryptosystem that, unlike the classical RSA key equation $ed - k (p-1)(q-1) = 1$, uses the key equation $ed - k r = 1$, where $r | p-1$ and is a large prime number. In this paper, we study if small private key attacks based on lattices can be applied to Roman'kov's cryptosystem. More precisely, we argue that such attacks do not appear to be applicable to this scheme without substantial adaptations.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2024-11-23: last updated
- 2024-11-14: published
- Short URL
- https://ia.cr/2024/1861
- License
- https://creativecommons.org/licenses/by-nc-sa/4.0/
BibTeX
@misc{cryptoeprint:2024/1861,
author = {George Teseleanu},
title = {Another Lattice Attack Against an RSA-like Cryptosystem},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1861},
year = {2024},
url = {https://eprint.iacr.org/2024/1861}
}