Results 11 to 20 of about 103,432 (283)
WAGE: An Authenticated Encryption with a Twist
IACR Transactions on Symmetric Cryptology, 2020 This paper presents WAGE, a new lightweight sponge-based authenticated cipher whose underlying permutation is based on a 37-stage Galois NLFSR over F27.
Riham AlTawy +3 more
doaj +1 more source
Skew characters and cyclic sieving
Forum of Mathematics, Sigma, 2021 In 2010, Rhoades proved that promotion on rectangular standard Young tableaux, together with the associated fake-degree polynomial, provides an instance of the cyclic sieving phenomenon.
Per Alexandersson +3 more
doaj +1 more source
Dynamic S-Box Design Using a Novel Square Polynomial Transformation and Permutation
IEEE Access, 2021 New era ciphers employ substitution boxes (S-boxes) which assist in the provision of security for the plaintext in the encryption phase and transforming the ciphertext on the receiver side into original plaintext in the decryption phase.
Amjad Hussain Zahid +11 more
doaj +1 more source
Permutation Classes of Polynomial Growth [PDF]
, 2007 A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations.
M. D. Atkinson +5 more
core +4 more sources
Efficient classical algorithms for simulating symmetric quantum systems [PDF]
Quantum, 2023 In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts given certain
Eric R. Anschuetz +3 more
doaj +1 more source
Permutation polynomials with Carlitz rank 2 [PDF]
Discrete Mathematics, 2021 Comment: 10 pages, comments are ...
José Alves Oliveira +1 more
openaire +3 more sources
On permutation polynomials over finite fields
International Journal of Mathematics and Mathematical Sciences, 1987 A polynomial f over a finite field F is called a permutation polynomial if the mapping F→F defined by f is one-to-one. In this paper we consider the problem of characterizing permutation polynomials; that is, we seek conditions on the coefficients of a ...
R. A. Mollin, C. Small
doaj +1 more source
A Formula for the Möbius Function of the Permutation Poset Based on a Topological Decomposition [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 The poset P of all permutations ordered by pattern containment is a fundamental object of study in the field of permutation patterns. This poset has a very rich and complex topology and an understanding of its Möbius function has proved particularly ...
Jason P Smith
doaj +1 more source
A linear time algorithm for the orbit problem over cyclic groups [PDF]
, 2014 The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same orbit with ...
Anthony Widjaja, Lin, Sanming Zhou
core +1 more source
International Journal of Mathematics and Mathematical Sciences, 1990 A polynomial f over a finite feld F is a permutation polynomial if the mapping F→F defined by f is one-to-one. We are concerned here with binomials, that is, polynomials of the shape f=aXi+bXj+c, i>j≥1.
Charles Small
doaj +1 more source