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: | |
---|---|
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 |
Summary: | 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 is
outlined, in relation to its applications in cryptology. |
---|---|
ISSN: | 1561-4042 |