In CRYPTO'03, Patarin conjectured a lower bound on the number of distinct solutions (P
1,…, P q)∈({0, 1} n) q satisfying a system of equations of the form X i⊕ X j= λ i, j such that P …

In CRYPTO 2019, Chen et al. have initiated an interesting research direction in designing
PRF based on public permutations. They have proposed two beyond the birthday bound …

The desirable encryption scheme possesses high PRF security, high efficiency, and the
ability to produce variable-length outputs. Since designing dedicated secure PRFs is …

Public permutations have been established as important primitives for the purpose of
designing cryptographic schemes. While many such schemes for authentication and …

In this work, we propose a construction of 2-round tweakable substitutionpermutation
networks using a single secret S-box. This construction is based on non-linear permutation …

In CRYPTO'03, Patarin conjectured a lower bound on the number of distinct solutions (P1,...,
Pq)∈({0, 1} n) q satisfying a system of equations of the form **⊕ Xj= λi, j such that X1, X2 …

Public permutations have been established as valuable primitives since the absence of a
key schedule compared to block ciphers alleviates cryptanalysis. While many permutation …

The indistinguishability security of a cryptographic construction refers to the maximum
advantage of an interactive adversary to distinguish between the real and ideal world, where …

This thesis proposes and analyses the security of a few symmetric key modes. The first three
of them are NAEAD modes, named Oribatida, ISAP+ and OCB+. Oribatida is lightweight …

In this dissertation, we focus on designing secure symmetric-key schemes by identifying
flaws, proposing new constructions, and providing rigorous security proofs against classical …