Finite Fields and Discrete Mathematics

1992 ◽  
pp. 122-138
Author(s):  
Igor E. Shparlinski
Keyword(s):  
Finite Fields ◽  
Discrete Mathematics

scholarly journals Classification of Filiform Lie Algebras up to dimension 7 Over Finite Fields

2016 ◽  
Vol 24 (2) ◽  
pp. 185-204
Author(s):  
Óscar J. Falcón ◽  
Raúl M. Falcón ◽  
Juan Núñez ◽  
Ana M. Pacheco ◽  
M. Trinidad Villar
Keyword(s):  
Graph Theory ◽  
Lie Algebra ◽  
Lie Algebras ◽  
Finite Fields ◽  
Discrete Mathematics ◽  
Main Interest ◽  
Filiform Lie Algebras ◽  
Suitable Technique ◽  
New Strategies

Abstract This paper tries to develop a recent research which consists in using Discrete Mathematics as a tool in the study of the problem of the classification of Lie algebras in general, dealing in this case with filiform Lie algebras up to dimension 7 over finite fields. The idea lies in the representation of each Lie algebra by a certain type of graphs. Then, some properties on Graph Theory make easier to classify the algebras. As main results, we find out that there exist, up to isomorphism, six, five and five 6-dimensional filiform Lie algebras and fifteen, eleven and fifteen 7-dimensional ones, respectively, over ℤ/pℤ, for p = 2, 3, 5. In any case, the main interest of the paper is not the computations itself but both to provide new strategies to find out properties of Lie algebras and to exemplify a suitable technique to be used in classifications for larger dimensions.

Finite Fields

1996 ◽  
Author(s):  
Rudolf Lidl ◽  
Harald Niederreiter
Keyword(s):  
Finite Fields

Maximum Distance Separable Hankel Rhotrices over Finite Fields

2018 ◽  
Vol 43 (1-4) ◽  
pp. 13-45
Author(s):  
Prof. P. L. Sharma ◽  
◽  
Mr. Arun Kumar ◽  
Mrs. Shalini Gupta ◽  
◽  
...  
Keyword(s):  
Finite Fields ◽  
Maximum Distance ◽  
Maximum Distance Separable

Notes on three-pass protocol

2020 ◽  
Vol 25 (4) ◽  
pp. 4-9
Author(s):  
Yerzhan R. Baissalov ◽  
Ulan Dauyl
Keyword(s):  
Finite Fields ◽  
Matrix Algebras ◽  
Associative Structures

The article discusses primitive, linear three-pass protocols, as well as three-pass protocols on associative structures. The linear three-pass protocols over finite fields and the three-pass protocols based on matrix algebras are shown to be cryptographically weak.

About the Complexity of Square Root Extraction Algorithms in Finite Fields and Residue Rings

Vestnik MEI ◽  
2018 ◽  
Vol 5 (5) ◽  
pp. 79-88
Author(s):  
Sergey B. Gashkov ◽  
◽  
Aleksandr B. Frolov ◽  
Elizaveta Р. Popova ◽  
◽  
...  
Keyword(s):  
Finite Fields ◽  
Square Root ◽  
Root Extraction

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.

Sign in / Sign up

Export Citation Format

Share Document