RUS  ENG
Full version
JOURNALS // Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] // Archive

Mat. Vopr. Kriptogr., 2019 Volume 10, Issue 2, Pages 135–144 (Mi mvk291)

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.

UDC: 519.719.2

Received 06.II.2018

Language: English

DOI: 10.4213/mvk291



© Steklov Math. Inst. of RAS, 2024