Concept
Parity of a permutation
Related publications (32)
Revisiting the Indifferentiability of the Sum of Permutations
The sum of two n-bit pseudorandom permutations is known to behave like a pseudorandom function with n bits of security. A recent line of research has investigated the security of two public n-bit permutations and its degree of indifferentiability. Mandal e ...
Springer2023From Trees to Barcodes and Back Again:A Combinatorial, Probabilistic and Geometric Study of a Topological Inverse Problem
In this thesis, we investigate the inverse problem of trees and barcodes from a combinatorial, geometric, probabilistic and statistical point of view.Computing the persistent homology of a merge tree yields a barcode B. Reconstructing a tree from B involve ...
EPFL2022Optimizing Quantum Circuit Synthesis for Permutations Using Recursion
We describe a family of recursive methods for the synthesis of qubit permutations on quantum computers with limited qubit connectivity. Two objectives are of importance: circuit size and depth. In each case we combine a scalable heuristic with a nonscalabl ...
ASSOC COMPUTING MACHINERY2022Efficient Preparation of Cyclic Quantum States
Giovanni De Micheli, Fereshte Mozafari Ghoraba
Universal quantum algorithms that prepare arbitrary n-qubit quantum states require O(2n) gate complexity. The complexity can be reduced by considering specific families of quantum states depending on the task at hand. In particular, multipartite quantum st ...
IEEE2022A Large, Finite Permutation of Specific, Discrete Variants: Dan Graham's Children's Pavilion at Chambres d'Amis (1986)
In 1986, Dan Graham participated in Chambres d'Amis in Ghent, Belgium, curated by Jan Hoet as an art exhibition outside of the museum, in individual houses. With the help of a local architect, Graham constructed a glass and steel pavilion in a private gard ...
ROUTLEDGE JOURNALS, TAYLOR & FRANCIS LTD2021Serial Lightweight Implementation Techniques for Block Ciphers
Most of the cryptographic protocols that we use frequently on the internet are designed in a fashion that they are not necessarily suitable to run in constrained environments. Applications that run on limited-battery, with low computational power, or area ...
EPFL2021Unique decomposition of homogeneous languages and application to isothetic regions
A language is said to be homogeneous when all its words have the same length. Homogeneous languages thus form a monoid under concatenation. It becomes freely commutative under the simultaneous actions of every permutation group G(n) on the collection of ho ...
2019Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel
Rüdiger Urbanke, Kirill Ivanov
In this paper, we consider the problem of decoding Reed-Muller (RM) codes in binary erasure channel. We propose a novel algorithm, which exploits several techniques, such as list recursive (successive cancellation) decoding based on Plotkin decomposition, ...
IEEE2019Beyond Conventional Security in Sponge-Based Authenticated Encryption Modes
The Sponge function is known to achieve 2c/2 security, where c is its capacity. This bound was carried over to its keyed variants, such as SpongeWrap, to achieve a min{2c/2,2 kappa} security bound, with kappa the key length. Similarly, many CAESAR competit ...
SPRINGER2019