Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 145 tok/s
Gemini 2.5 Pro 40 tok/s Pro
GPT-5 Medium 22 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 107 tok/s Pro
Kimi K2 195 tok/s Pro
GPT OSS 120B 446 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

A new construction of differentially 4-uniform permutations over $F_{2^{2k}}$ (1407.4884v1)

Published 18 Jul 2014 in cs.IT and math.IT

Abstract: Permutations over $F_{2{2k}}$ with low differential uniform, high algebraic degree and high nonlinearity are of great cryptographical importance since they can be chosen as the substitution boxes (S-boxes) for many block ciphers. A well known example is that the Advanced Encryption Standard (AES) chooses a differentially 4-uniform permutation, the multiplicative inverse function, as its S-box. In this paper, we present a new construction of differentially 4-uniformity permutations over even characteristic finite fields and obtain many new CCZ-inequivalent functions. All the functions are switching neighbors in the narrow sense of the multiplicative inverse function and have the optimal algebraic degree and high nonlinearity.

Citations (3)

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.