Time Estimation of Cheon's Algorithm over Elliptic Curves on Finite Fields with Characteristic 3

2011 ◽  
Author(s):  
Tetsuya Izu ◽  
Masahiko Takenaka ◽  
Masaya Yasuda
Keyword(s):  
Elliptic Curves ◽  
Finite Fields ◽  
Time Estimation ◽  
Characteristic 3

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 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.

scholarly journals Reduction of Elliptic Curves in Equal Characteristic 3 (and 2)

2005 ◽  
Vol 48 (3) ◽  
pp. 428-444
Author(s):  
Roland Miyamoto ◽  
Jaap Top
Keyword(s):  
Elliptic Curves ◽  
Fibre Type ◽  
Valued Fields ◽  
Characteristic 2 ◽  
Characteristic 3

AbstractWe determine conductor exponent, minimal discriminant and fibre type for elliptic curves over discrete valued fields of equal characteristic 3. Along the same lines, partial results are obtained in equal characteristic 2.

Sign in / Sign up

Export Citation Format

Share Document