Discrete logarithm like problems and linear recurring sequences

DOI10.3934/amc.2013.7.187zbMath1271.11116OpenAlexW1984279983MaRDI QIDQ1948461

Consuelo Martínez, Hugo Villafañe, Llorenç Huguet, 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

linear recurring sequencesdiscrete logarithm problempublic key cryptographycompact representationDiffie-Hellman problemhardness assumptions

Mathematics Subject Classification ID

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

Related Items (1)

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