RO EN
Finite fields and cryptology
Authors: Ennio Cortellini
Keywords: Finite field, discrete logarithm, encryption, signature.
– 0.18 Mb
Keywords: Finite field, discrete logarithm, encryption, signature.
Abstract
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.Ennio Cortellini,
MET Department,
University of Teramo, Italy
E-mail:
MET Department,
University of Teramo, Italy
E-mail:
Fulltext
– 0.18 Mb
Contents
- Polynomial time algorithm for solving cyclic games
- Gray Code for Cayley Permutations
- Quasi-stability of a vector trajectorial problem with non-linear partial criteria
- Finite fields and cryptology
- Mobile Communications World: Security Implementations Aspects - A State of the Art
- Combined Randomized-Local Hough Transform versus UpWrite Transform in stamp detection
- Lower Bounds and Semi On-line Multiprocessor Scheduling
