Discrete logarithm like problems and linear recurring sequences

DOI10.3934/AMC.2013.7.187MaRDI QIDQ1948461zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

compact representationDiffie-Hellman problemdiscrete logarithm problemhardness assumptionslinear recurring sequencespublic key cryptography

Mathematics Subject Classification ID

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

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

Cited in

(2)

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

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)