Discrete logarithm like problems and linear recurring sequences

DOI10.3934/AMC.2013.7.187zbMATH Open1271.11116OpenAlexW1984279983MaRDI QIDQ1948461FDOQ1948461

Authors: Llorenç Huguet, Consuelo Martínez, Hugo Villafañe, Santos González 

Publication date: 6 May 2013

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2013.7.187

Recommendations

• Finite fields and cryptology
• On the complexity of the discrete logarithm and Diffie-Hellman problems
• Lower bounds on the linear complexity of the discrete logarithm in finite fields
• Number theoretic methods in cryptography. Complexity lower bounds
• Discrete logarithms: The past and the future

zbMATH Keywords

discrete logarithm problemlinear recurring sequencespublic key cryptographycompact representationDiffie-Hellman problemhardness assumptions

Mathematics Subject Classification ID

Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Recurrences (11B37)

Cited In (2)

• Existence of sequences satisfying bilinear type recurrence relations
• Comparison analysis of Ding's RLWE-based key exchange protocol and NewHope variants

This page was built for publication: Discrete logarithm like problems and linear recurring sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1948461)