Unicyclic strong permutations

DOI10.1007/s12095-019-00384-4zbMath1446.11205arXiv1809.03551OpenAlexW2890991810WikidataQ127486722 ScholiaQ127486722MaRDI QIDQ2179491

David Thomson, Claude Gravel, Daniel Panario

Publication date: 12 May 2020

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.03551

zbMATH Keywords

permutationsfinite fieldsBoolean functionsdifferential uniformityalgebraic degreeWalsh spectra

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials over finite fields (11T06) Boolean functions (94D10)

Related Items (2)

Tangent-Chebyshev maps over finite fields: new properties and functional graphs ⋮ Feedback linearly extended discrete functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Differential cryptanalysis of DES-like cryptosystems
• The generation of random permutations on the fly
• Handbook of Finite Fields
• Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
• A spectral characterization of correlation-immune combining functions
• Primitive Polynomials Over Finite Fields
• Generators and irreducible polynomials over finite fields
• Generating Random Permutations by Coin Tossing

This page was built for publication: Unicyclic strong permutations