Fast evaluation of Rédei functions

DOI10.1007/BF01195335zbMath0820.11079OpenAlexW1971474622MaRDI QIDQ1842607

Willi More

Publication date: 14 September 1995

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01195335

zbMATH Keywords

complexityfinite fieldscryptographyprimalityfast evaluationRédei functions

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05) Primality (11Y11)

Related Items (4)

An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics ⋮ Tangent-Chebyshev maps over finite fields: new properties and functional graphs ⋮ Group law on affine conics and applications to cryptography ⋮ Pell hyperbolas in DLP-based cryptosystems

Cites Work

• Rédei-Permutationen auf Restklassenringen \({\mathbb{Z}}/(m)\). (Rédei- permutations over residue class rings \({\mathbb{Z}}/(m))\)
• Generalizations of the Fibonacci pseudoprimes test
• Cryptanalysis of Rédei- and Dickson permutations on arbitrary finite rings
• Rédei-Funktionen für Zweierpotenzen. (Rédei functions for powers of two)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast evaluation of Rédei functions