We present Orthros, a 128-bit block pseudorandom function. It is designed with primary
focus on latency of fully unrolled circuits. For this purpose, we adopt a parallel structure …

Contents Page 1 CRITICAL PERSPECTIVES ON PROVABLE SECURITY: FIFTEEN YEARS OF
“ANOTHER LOOK” PAPERS NEAL KOBLITZ AND ALFRED MENEZES Abstract. We give an …

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 …

For several decades, constructing pseudorandom functions from pseudorandom
permutations, so-called Luby-Rackoff backward construction, has been a popular …

At CRYPTO 2019, constructions of a pseudorandom function from public random
permutations were presented. We consider one of the constructions called Sum of Even …

In this paper we deepen our understanding of how to apply Simon's algorithm to break
symmetric cryptographic primitives. On the one hand, we automate the search for new …

In the recent trend of CAESAR competition and NIST light-weight competition, cryptographic
community have witnessed the submissions of several cryptographic schemes that are build …

Constructions based on two public permutation calls are very common in today's
cryptographic community. However, each time a new construction is introduced, a dedicated …

In an early version of CRYPTO'17, Mennink and Neves proposed EWCDMD, a dual of
EWCDM, and showed n-bit security, where n is the block size of the underlying block cipher …

At CRYPTO 2019, Chen et al. have shown a beyond the birthday bound secure n-bit to n-bit
PRF based on public random permutations. Followed by the work, Dutta and Nandi have …