Finite fields and cryptology
The problem of a computationally feasible method of finding the discrete logarithm in a (large) finite field is discussed, presenting the main algorithms in this direction. Some cryptographic schemes based on the discrete logarithm are presented. Finally, the theory of linear recurring sequences...
Main Author: | Ennio Cortellini |
---|---|
Format: | Article |
Language: | English |
Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2003-10-01
|
Series: | Computer Science Journal of Moldova |
Subjects: | |
Online Access: | http://www.math.md/files/csjm/v11-n2/v11-n2-(pp150-167).pdf |
Similar Items
-
Discrete logarithm problem in matrix
by: Povilas Tvarijonas, et al.
Published: (2023-09-01) -
Cryptology /
by: 373564 Beutelspacher, Albrecht, et al.
Published: (1994) -
A New Secure Encryption Scheme Based on Group Factorization Problem
by: Yue Cong, et al.
Published: (2019-01-01) -
Blind Collective Signature Protocol
by: Nikolay A. Moldovyan
Published: (2011-06-01) -
A Modified Wei-Hua-He Digital Signature Scheme Based on Factoring and Discrete Logarithm
by: Elumalai R, et al.
Published: (2022-11-01)