## Journals

- Advances in Mathematics of Communications
- Big Data & Information Analytics
- Communications on Pure & Applied Analysis
- Discrete & Continuous Dynamical Systems - A
- Discrete & Continuous Dynamical Systems - B
- Discrete & Continuous Dynamical Systems - S
- Evolution Equations & Control Theory
- Inverse Problems & Imaging
- Journal of Computational Dynamics
- Journal of Dynamics & Games
- Journal of Geometric Mechanics
- Journal of Industrial & Management Optimization
- Journal of Modern Dynamics
- Kinetic & Related Models
- Mathematical Biosciences & Engineering
- Mathematical Control & Related Fields
- Mathematical Foundations of Computing
- Networks & Heterogeneous Media
- Numerical Algebra, Control & Optimization
- Electronic Research Announcements
- Conference Publications
- AIMS Mathematics

AMC

In this paper we study the hardness of some discrete logarithm
like problems defined in linear recurring sequences over finite
fields from a point of view as general as possible. The
intractability of these problems plays a key role in the security
of the class of public key cryptographic constructions based on
linear recurring sequences. We define new discrete logarithm,
Diffie-Hellman and decisional Diffie-Hellman problems for any
nontrivial linear recurring sequence in any finite field whose
minimal polynomial is irreducible. Then, we prove that these
problems are polynomially equivalent to the discrete logarithm,
Diffie-Hellman and decisional Diffie-Hellman problems in the
subgroup generated by any root of the minimal polynomial of the
sequence.

## Year of publication

## Related Authors

## Related Keywords

[Back to Top]