Order counting of elliptic curves defined over finite fields of characteristic 2

2001 ◽  
Vol 85 (1) ◽  
pp. 62-70
Author(s):  
Tetsuya Izu ◽  
Jun Kogure ◽  
Masayuki Noro ◽  
Kazuhiro Yokoyama
Keyword(s):  
Elliptic Curves ◽  
Finite Fields ◽  
Characteristic 2

PERSPECTIVES OF ELLIPTICAL CRYPTOGRAPHY TO ENSURE THE INTEGRITY AND CONFIDENTIALITY OF INFORMATION

2019 ◽  
Author(s):  
Anna ILYENKO ◽  
Sergii ILYENKO ◽  
Yana MASUR
Keyword(s):  
Information Systems ◽  
Elliptic Curve ◽  
Elliptic Curves ◽  
Finite Fields ◽  
Computational Efficiency ◽  
Digital Signature ◽  
Discrete Logarithm ◽  
Algebraic Groups ◽  
Schnorr Signature ◽  
Stability Of Algorithms

In this article, the main problems underlying the current asymmetric crypto algorithms for the formation and verification of electronic-digital signature are considered: problems of factorization of large integers and problems of discrete logarithm. It is noted that for the second problem, it is possible to use algebraic groups of points other than finite fields. The group of points of the elliptical curve, which satisfies all set requirements, looked attractive on this side. Aspects of the application of elliptic curves in cryptography and the possibilities offered by these algebraic groups in terms of computational efficiency and crypto-stability of algorithms were also considered. Information systems using elliptic curves, the keys have a shorter length than the algorithms above the finite fields. Theoretical directions of improvement of procedure of formation and verification of electronic-digital signature with the possibility of ensuring the integrity and confidentiality of information were considered. The proposed method is based on the Schnorr signature algorithm, which allows data to be recovered directly from the signature itself, similarly to RSA-like signature systems, and the amount of recoverable information is variable depending on the information message. As a result, the length of the signature itself, which is equal to the sum of the length of the end field over which the elliptic curve is determined, and the artificial excess redundancy provided to the hidden message was achieved.

scholarly journals On the existence of some specific elements in finite fields of characteristic 2

2012 ◽  
Vol 18 (4) ◽  
pp. 800-813 ◽  
Author(s):  
Peipei Wang ◽  
Xiwang Cao ◽  
Rongquan Feng
Keyword(s):  
Finite Fields ◽  
Characteristic 2

scholarly journals Construction of elliptic curves with cyclic groups over prime fields

2006 ◽  
Vol 73 (2) ◽  
pp. 245-254 ◽  
Author(s):  
Naoya Nakazawa
Keyword(s):  
Elliptic Curves ◽  
Finite Fields ◽  
Function Field ◽  
Modular Group ◽  
Modular Function ◽  
Invariant Function ◽  
Rational Points ◽  
Modular Invariant ◽  
Cyclic Groups ◽  
Prime Fields

The purpose of this article is to construct families of elliptic curves E over finite fields F so that the groups of F-rational points of E are cyclic, by using a representation of the modular invariant function by a generator of a modular function field associated with the modular group Γ0(N), where N = 5, 7 or 13.

Sign in / Sign up

Export Citation Format

Share Document