|
Construction of strong elliptic curves suitable for cryptographic applications
A. Yu. Nesterenko HSE Tikhonov Moscow Institute of Electronics and Mathematics
(MIEM HSE), Moscow, Russia
Abstract:
An algorithm for the construction of elliptic curves satisfying special requirements is presented. The choice of requirements aims to prevent known attacks on the elliptic curve discrete logarithm problem in special cases. The results of practical experiments are discussed, some parameters of concrete elliptic curves are given.
Key words:
elliptic curve, discrete logarithm problem, complex multiplication.
Received 06.II.2018
Citation:
A. Yu. Nesterenko, “Construction of strong elliptic curves suitable for cryptographic applications”, Mat. Vopr. Kriptogr., 10:2 (2019), 135–144
Linking options:
https://www.mathnet.ru/eng/mvk291https://doi.org/10.4213/mvk291 https://www.mathnet.ru/eng/mvk/v10/i2/p135
|
Statistics & downloads: |
Abstract page: | 407 | Full-text PDF : | 89 | References: | 43 | First page: | 16 |
|