Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

The locally crooked permutations and the complete permutations over F2n

View through CrossRef
Abstract The crooked function has a fixed point $0$ and all its difference set is the complement of the hyperplane. In this paper, we proposed the locally crooked permutation, at least one of its differential sets is the complement of a hyperplane. We found a close relationship between the locally crooked permutation and the complete permutation. Specifically, the complete permutations over $\mathbb{F}_{2^{n}}$ can be obtained from the locally crooked permutations over $\mathbb{F}_{2^{n+1}}$, and vice versa. In particular, we construct the complete permutations with best-known differential uniformity and nonlinearity and the locally crooked permutations with differential uniformity of $4$ over $\mathbb{F}_{2^{2n}}$. Besides, we also found that the existence of the APN permutation that is locally crooked over $\mathbb{F}_{2^{2n+2}}$ is closely related to the nonlinear complete permutation over $\mathbb{F}_{2^{2n+1}}$. MSC Classification: 05A05 , 11T06 , 11T55
Springer Science and Business Media LLC
Title: The locally crooked permutations and the complete permutations over F2n
Description:
Abstract The crooked function has a fixed point $0$ and all its difference set is the complement of the hyperplane.
In this paper, we proposed the locally crooked permutation, at least one of its differential sets is the complement of a hyperplane.
We found a close relationship between the locally crooked permutation and the complete permutation.
Specifically, the complete permutations over $\mathbb{F}_{2^{n}}$ can be obtained from the locally crooked permutations over $\mathbb{F}_{2^{n+1}}$, and vice versa.
In particular, we construct the complete permutations with best-known differential uniformity and nonlinearity and the locally crooked permutations with differential uniformity of $4$ over $\mathbb{F}_{2^{2n}}$.
Besides, we also found that the existence of the APN permutation that is locally crooked over $\mathbb{F}_{2^{2n+2}}$ is closely related to the nonlinear complete permutation over $\mathbb{F}_{2^{2n+1}}$.
MSC Classification: 05A05 , 11T06 , 11T55.

Related Results

METHODS FOR CONSTRUCTING PERMUTATIONS OF AN ARBITRARY FINITE FIELD AND THEIR LINEAR CHARACTERISTICS
METHODS FOR CONSTRUCTING PERMUTATIONS OF AN ARBITRARY FINITE FIELD AND THEIR LINEAR CHARACTERISTICS
Permutations in a finite field (bijective transformations) are actively studied in many applications, including in information security theory. Permutations are often used as eleme...
Exploring Large Language Models Integration in the Histopathologic Diagnosis of Skin Diseases: A Comparative Study
Exploring Large Language Models Integration in the Histopathologic Diagnosis of Skin Diseases: A Comparative Study
Abstract Introduction The exact manner in which large language models (LLMs) will be integrated into pathology is not yet fully comprehended. This study examines the accuracy, bene...
Distribution of Segment Lengths in Genome Rearrangements
Distribution of Segment Lengths in Genome Rearrangements
The study of gene orders for constructing phylogenetic trees was introduced by Dobzhansky and Sturtevant in 1938. Different genomes may have homologous genes arranged in different...
A lower bound for general t-stack sortable permutations via pattern avoidance
A lower bound for general t-stack sortable permutations via pattern avoidance
There is no formula for general t-stack sortable permutations. Thus, we attempt to study them by establishing lower and upper bounds. Permutations that avoid certain pattern sets p...
The state diagram of $$\chi $$
The state diagram of $$\chi $$
AbstractIn symmetric cryptography, block ciphers, stream ciphers and permutations often make use of a round function and many round functions consist of a linear and a non-linear l...
Permutation compression with applications to genomic data
Permutation compression with applications to genomic data
[ACCESS RESTRICTED TO THE UNIVERSITY OF MISSOURI AT AUTHOR'S REQUEST.] High Sequencing Technology generates data at an increasing rate. The technology is used widely in molecular b...
ALGORITHMS TO REALIZE AN ARBITRARY BPC PERMUTATION IN CHORDAL RING NETWORKS WITH FAILURES
ALGORITHMS TO REALIZE AN ARBITRARY BPC PERMUTATION IN CHORDAL RING NETWORKS WITH FAILURES
A family of regular graphs of degree 3, called chordal rings is presented as a possible candidate for the implementation of a distributed system and for fault-tolerant architecture...

Back to Top