Fast evaluation of Rédei functions
type: Item
instance of: scholarly article
title: Fast evaluation of Rédei functions
zbMATH Open document ID: 0820.11079
DOI: 10.1007/BF01195335
author: Willi More
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 1995-09-14T00:00:00Z
review text: The author presents a fast evaluation for Rédei functions (which are of value in cryptographic applications) of complexity \(O(\log_ 2 n)\).
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 11Y11
Mathematics Subject Classification ID: 11Y05
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 750799
zbMATH Keywords: cryptography
zbMATH Keywords: primality
zbMATH Keywords: finite fields
zbMATH Keywords: fast evaluation
zbMATH Keywords: Rédei functions
zbMATH Keywords: complexity
reviewed by: Richard A. Mollin
MaRDI profile type: Publication
cites work: Generalizations of the Fibonacci pseudoprimes test
cites work: Q3988504
cites work: Q3754704
cites work: Q3748194
cites work: Rédei-Permutationen auf Restklassenringen \({\mathbb{Z}}/(m)\). (Rédei- permutations over residue class rings \({\mathbb{Z}}/(m))\)
cites work: Q3708876
cites work: Rédei-Funktionen für Zweierpotenzen. (Rédei functions for powers of two)
cites work: Q3997368
cites work: Cryptanalysis of Rédei- and Dickson permutations on arbitrary finite rings
cites work: Q5839982
full work available at URL: https://doi.org/10.1007/bf01195335
OpenAlex ID: W1971474622
description: scientific article; zbMATH DE number 750799