Decompositions of graphs of functions and fast iterations of lookup tables

DOI10.1016/J.DAM.2006.06.006zbMath1113.05004OpenAlexW1997195224MaRDI QIDQ868394

Boaz Tsaban

Publication date: 2 March 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.06.006

zbMATH Keywords

cycle structurecycle decompositionfast forward functionsfast forward permutations

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Efficient computation of the iteration of functions

Cites Work

• Constructing pseudo-random permutations with a prescribed structure
• Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation
• On the Implementation of Huge Random Objects

This page was built for publication: Decompositions of graphs of functions and fast iterations of lookup tables