Cryptographically Strong Elliptic Curves of Prime Order
The purpose of this paper is to generate cryptographically strong elliptic curves over prime fields Fp, where p is a Mersenne prime, one of the special primes or a random prime. We search for elliptic curves which orders are also prime numbers. The cryptographically strong elliptic curves are those...
Main Authors: | Marcin Barański, Rafał Gliwa, Janusz Szmidt |
---|---|
Format: | Article |
Language: | English |
Published: |
Polish Academy of Sciences
2021-05-01
|
Series: | International Journal of Electronics and Telecommunications |
Subjects: | |
Online Access: | https://journals.pan.pl/Content/118887/PDF/30_3224_Szmidt_L_sk_new.pdf |
Similar Items
-
A complete classification of the Mersenne’s primes and its implications for computing
by: Yeisson Alexis Acevedo Agudelo
Published: (2020-12-01) -
Elliptic-curve cryptographic architectures for system-on-chip based on field programmable gate arrays /
by: Arif Irwansyah, 1977-, et al.
Published: (2009) -
Elliptic-curve cryptographic architectures for system-on-chip based on field programmable gate arrays [electronic resource] /
by: Arif Irwansyah, 1977-, et al.
Published: (2009) -
The review on elliptic curves as cryptographic pairing groups
by: E Khamseh
Published: (2021-05-01) -
Differential operators over particular elliptic curves spaces with cryptographic applications
by: Oana Adriana Ticleanu
Published: (2015-12-01)