Related papers: Balanced permutations Even-Mansour ciphers
We study the problem of identifying an n-bit string using a single quantum query to an oracle that computes the Hamming distance between the query and hidden strings. The standard action of the oracle on a response register of dimension r…
Ring signatures are a powerful primitive that allows a member to sign on behalf of a group, without revealing their identity. Recently, ring signatures have received additional attention as an ingredient for post-quantum deniable…
In this paper, we extend recent results about the distribution of even and odd gaps of a numerical semigroup. We find that, for any numerical semigroup, the distribution can be computed in terms of the numbers of or the sums of odd and even…
The full-information model was introduced by Ben-Or and Linial in 1985 to study collective coin-flipping: the problem of generating a common bounded-bias bit in a network of $n$ players with $t=t(n)$ faults. They showed that the majority…
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptography. Moreover, they satisfy a semi-group property, which…
Distributionally balanced sampling designs are low-discrepancy probability designs obtained by minimizing the expected discrepancy between the auxiliary-variable distribution of a random sample and the target population distribution.…
This paper is an attempt to build a new public-key cryptosystem; similar to the McEliece cryptosystem, using permutation error-correcting codes. We study a public-key cryptosystem built using two permutation error-correcting codes. We show…
Lightweight block cipher design has largely focused on incremental optimization of established paradigms such as substitution--permutation networks, Feistel structures, and ARX constructions, where security derives from the algebraic…
In this paper, we give a new bijective proof of a multiset analogue of even-odd permutations identity. This multiset version is equivalent to the original coin arrangements lemma which is a key combinatorial lemma in the Sherman's Proof of…
We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…
We consider a family $\mathcal F$ of maps with two branches and a common neutral fixed point $0$ such that the order of tangency at $0$ belongs to some interval $[\alpha_0, \alpha_1]\subset (0, 1)$. Maps in $\mathcal F$ do not necessarily…
We study the random composition of a small family of O(n^3) simple permutations on {0,1}^n. Specifically we ask how many randomly selected simple permutations need be composed to yield a permutation that is close to k-wise independent. We…
Given a block cipher of length L Cook's elastic cipher allows to encrypt messages of variable length from L to 2L. Given some conditions on the key schedule, Cook's elastic cipher is secure against any key recovery attack if the underlying…
In this paper, we show that the Advanced Encryption Standard (AES) cryptosystem can be used as an error-correcting code to obtain reliability over noisy communication and data systems. Moreover, we characterize a family of computational…
Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…
Alice communicates with words drawn uniformly amongst $\{\ket{j}\}_{j=1..n}$, the canonical orthonormal basis. Sometimes however Alice interleaves quantum decoys $\{\frac{\ket{j}+i\ket{k}}{\sqrt{2}}\}$ between her messages. Such pairwise…
We propose a proof of the security of EPR-based quantum key distribution against enemies with unlimited computational power. The proof holds for a protocol using interactive error-reconciliation scheme. We assume in this paper that the…
Einstein-Podolsky-Rosen- (EPR) and the more powerful Mayers-Lo-Chau attack impose a serious constraint on quantum bit commitment (QBC). As a way to circumvent them, it is proposed that the quantum system encoding the commitment chosen by…
We study uncloneable quantum encryption schemes for classical messages as recently proposed by Broadbent and Lord. We focus on the information-theoretic setting and give several limitations on the structure and security of these schemes:…
A permutation of the integers avoiding monotone arithmetic progressions of length $6$ was constructed in (Geneson, 2018). We improve on this by constructing a permutation of the integers avoiding monotone arithmetic progressions of length…