Paper 2011/427 Original: eprint.iacr.org/2011/427 ↗
A new attack on the KMOVcryptosystem
Abstract
In this paper, we analyze the security of the KMOV public key cryptosystem. KMOV is based on elliptic curves over the ring $\mathbb{Z}_n$ where $n=pq$ is the product of two large unknown primes of equal bit-size. We consider KMOV with a public key $(n,e)$ where the exponent $e$ satisfies an equation $ex-(p+1)(q+1)y=z$, with unknown parameters $x$, $y$, $z$. Using Diophantine approximations and lattice reduction techniques, we show that KMOV is insecure when $x$, $y$, $z$ are suitably small.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2011-08-12: last updated
- 2011-08-12: published
- Short URL
- https://ia.cr/2011/427
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2011/427,
author = {Abderrahmane Nitaj},
title = {A new attack on the KMOVcryptosystem},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/427},
year = {2011},
url = {https://eprint.iacr.org/2011/427}
}