Cryptanalysis of the Dickson-Scheme
From MaRDI portal
Publication:3720458
DOI10.1007/3-540-39805-8_7zbMath0591.94018OpenAlexW1606762295MaRDI QIDQ3720458
Winfried B. Müller, Rupert Nöbauer
Publication date: 1986
Published in: Advances in Cryptology — EUROCRYPT’ 85 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-39805-8_7
cryptanalytic attacksDickson polynomialspublic-key cryptosystemfixed point attackssuperencryption procedures
Cryptography (94A60) Polynomials over finite fields (11T06) Polynomials over commutative rings (13B25)
Related Items
An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics ⋮ Unnamed Item ⋮ New permutation trinomials constructed from fractional polynomials ⋮ Algebraic generalization of Diffie-Hellman key exchange ⋮ More classes of permutation trinomials with Niho exponents ⋮ Generalizations of the Fibonacci pseudoprimes test ⋮ On the security of the Lucas function ⋮ Polynomial representations of the Lucas logarithm
