English
Related papers

Related papers: Further results on differentially 4-uniform permut…

200 papers

In this paper, we describe non invertible matrix in GF(2)which can be used as multiplication matrix in Hill Cipher technique for one way hash algorithm. The matrices proposed are permutation matrices with exactly one entry 1 in each row and…

Cryptography and Security · Computer Science 2012-10-09 Artan Berisha , Behar Baxhaku , Artan Alidema

The modular transformation properties of admissible characters of the affine superalgebra sl(2|1;C) at fractional level k=1/u-1, u=2,3,... are presented. All modular invariants for u=2 and u=3 are calculated explicitly and an A-series and…

High Energy Physics - Theory · Physics 2009-10-31 Gavin Johnstone

This paper presents an approach for the development of a number theoretic discrete Hilbert transform. The forward transformation has been applied by taking the odd reciprocals that occur in the DHT matrix with respect to a power of 2.…

Discrete Mathematics · Computer Science 2009-11-13 Renuka Kandregula

Many-to-one mappings and permutation polynomials over finite fields have important applications in cryptography and coding theory. In this paper, we study the many-to-one property of a large class of polynomials such as $f(x) = h(a x^q + b…

Information Theory · Computer Science 2025-03-11 Yanbin Zheng , Meiying Zhang , Yanjin Ding , Zhengbang Zha , Qiang Wang

In this work, extension theorems are generalized to self-dual codes over rings and as applications many new binary self-dual extremal codes are found from self-dual codes over F_2^m+uF_2^m for m = 1, 2. The duality and distance preserving…

Information Theory · Computer Science 2016-11-26 Abidin Kaya , Bahattin Yildiz

In a XOR-based alternating block cipher the plaintext is masked by a sequence of layers each performing distinct actions: a highly nonlinear permutation, a linear transformation, and the bitwise key addition. When assessing resistance…

Group Theory · Mathematics 2024-04-16 Roberto Civino , Valerio Fedele

Discrete Fourier transforms~(DFTs) over finite fields have widespread applications in digital communication and storage systems. Hence, reducing the computational complexities of DFTs is of great significance. Recently proposed cyclotomic…

Information Theory · Computer Science 2015-05-19 Xuebin Wu , Meghanad Wagh , Ning Chen , Zhiyuan Yan , Ying Wang

In this paper, we propose a new algebraic structure of permutation polynomials over $\mathbb{F}_{q^n}$. As an application of this new algebraic structure, we give some classes of new PPs over $\mathbb{F}_{q^n}$ and answer an open problem in…

Number Theory · Mathematics 2024-10-24 Pingzhi Yuan

We investigate some differential properties for permutations in the affine group, of a vector space V over the binary field, with respect to a new group operation $\circ$, inducing an alternative vector space structure on $V$ .

Group Theory · Mathematics 2016-01-18 Marco Calderini , Massimiliano Sala

The partition function of 2d conformal field theory is a modular invariant function. It is known that the partition function of a holomorphic CFT whose central charge is a multiple of 24 is a polynomial in the Klein function. In this paper,…

High Energy Physics - Theory · Physics 2016-10-12 M. Ashrafi , F. Loran

The Robinson-Schensted correspondence can be viewed as a map from permutations to partitions. In this work, we study the number of inversions of permutations corresponding to a fixed partition $\lambda$ under this map. Hohlweg characterized…

Combinatorics · Mathematics 2022-01-03 Arvind Ayyer , Naya Banerjee

In this paper we construct directionally sensitive functions that can be viewed as directional time-frequency representations. We call such a sequence a rotational uniform covering frame and by studying rotations of the frame, we derive the…

Functional Analysis · Mathematics 2017-10-20 Wojciech Czaja , Weilin Li

An exact, one-to-one transform is presented that not only allows digital circular convolutions, but is free from multiplications and quantisation errors for transform lengths of arbitrary powers of two. The transform is analogous to the…

Numerical Analysis · Computer Science 2010-05-11 Shekhar S. Chandra

The classification of graded non-alternating Hamiltonian Lie algebras over perfect field of characteristic 2 is obtained. It is shown that the filtered deformations of such algebras correspond to non-alternating Hamiltonian forms with…

Rings and Algebras · Mathematics 2019-01-01 A. V. Kondrateva , M. I. Kuznetsov , N. G. Chebochko

In this paper, we study some properties of a certain kind of permutation $\sigma$ over $\mathbb{F}_{2}^{n}$, where $n$ is a positive integer. The desired properties for $\sigma$ are: (1) the algebraic degree of each component function is…

Cryptography and Security · Computer Science 2019-07-12 Claude Gravel , Daniel Panario , David Thomson

EFRST20, the notion of $c$-differentials was introduced as a potential expansion of differential cryptanalysis against block ciphers utilizing substitution boxes. Drawing inspiration from the technique of higher order differential…

Information Theory · Computer Science 2021-11-09 Aaron Geary , Marco Calderini , Constanza Riera , Pantelimon Stanica

The notion of $c$-differential uniformity has recently received a lot of attention since its proposal~\cite{Ellingsen}, and recently a characterization of perfect $c$-nonlinear functions in terms of difference sets in some quasigroups was…

Information Theory · Computer Science 2023-07-21 Kirpa Garg , Sartaj Ul Hasan , Pantelimon Stanica

In a prior paper [14], along with P. Ellingsen, P. Felke and A. Tkachenko, we defined a new (output) multiplicative differential, and the corresponding c-differential uniformity, which has the potential of extending differential…

Cryptography and Security · Computer Science 2020-07-07 Constanza Riera , Pantelimon Stanica

Inspired by a recent note of Zeilberger (arXiv:1110.4379), Alejandro Morales asked whether one can count alternating (i.e., up-down) permutations that contain the pattern 123 or 321 exactly once. In this note we answer the question in the…

Combinatorics · Mathematics 2011-11-07 Joel Brewster Lewis

Differential equations are a powerful tool for evaluating Feynman integrals. Their solution is straightforward if a transformation to a canonical form is found. In this paper, we present an algorithm for finding such a transformation. This…

High Energy Physics - Phenomenology · Physics 2020-06-24 Christoph Dlapa , Johannes Henn , Kai Yan