OleF: an Inverse-Free Online Cipher. An Online SPRP with an Optimal Inverse-Free Construction

Bhaumik, Ritam; Nandi, Mridul

doi:10.46586/tosc.v2016.i2.30-51

Cited by 3 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In fact, it was stated as an open problem [CNTY20] to design a BBB secure single permuation based PRF with two forward calls. Not only this, inverse-free designs become one of the important design aspects in today's cryptography as designs that rely solely on the forward call of the permutation makes a very low footprint in a combined implementation of the mode [BN16]. Therefore, until now we do not have any beyond birthday bound secure single permutation based fixed input and fixed output length PRF that opearates in sequential mode with two forward calls 3 .…”

Section: Permutation Based Cryptographymentioning

confidence: 99%

Permutation Based EDM: An Inverse Free BBB Secure PRF

Dutta¹,

Nandi

Talnikar

2021

ToSC

Self Cite

View full text Add to dashboard Cite

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 secure n-bit to n-bit PRF constructions, i.e., SoEM22 and SoKAC21, which are built on public permutations, where n is the size of the permutation. However, both of their constructions require two independent instances of public permutations. In FSE 2020, Chakraborti et al. have proposed a single public permutation based n-bit to n-bit beyond the birthday bound secure PRF, which they refer to as PDMMAC. Although the construction is minimal in the number of permutations, it requires the inverse call of its underlying permutation in their design. Coming up with a beyond the birthday bound secure public permutation based n-bit to n-bit PRF with a single permutation and two forward calls was left as an open problem in their paper. In this work, we propose pEDM, a single permutation based n-bit to n-bit PRF with two calls that do not require invertibility of the permutation. We have shown that our construction is secured against all adaptive information-theoretic distinguishers that make roughly up to 22n/3 construction and primitive queries. Moreover, we have also shown a matching attack with similar query complexity that establishes the tightness of our security bound.

show abstract

Section: Permutation Based Cryptographymentioning

confidence: 99%

Permutation Based EDM: An Inverse Free BBB Secure PRF

Dutta¹,

Nandi

Talnikar

2021

ToSC

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, if we consider E k to behave like a random function, the ciphertext will always be perfectly random, and distinguishing counter mode from random reduces to distinguishing E k from a random function. The trick to view a PRP as a PRF is called the "PRP-PRFswitch," and it finds myriad applications in existing symmetric key security proofs (e.g., [3,10,18,22,26,36,40,41,46]).…”

Section: Introductionmentioning

confidence: 99%

XOR of PRPs in a Quantum World

Mennink

Szepieniec

2017

Post-Quantum Cryptography

View full text Add to dashboard Cite

This publication is distributed under the terms of Article 25fa of the Dutch Copyright Act (Auteurswet) with explicit consent by the author. Dutch law entitles the maker of a short scientific work funded either wholly or partially by Dutch public funds to make that work publicly available for no consideration following a reasonable period of time after the work was first published, provided that clear reference is made to the source of the first publication of the work. This publication is distributed under The Association of Universities in the Netherlands (VSNU) 'Article 25fa implementation' pilot project. In this pilot research outputs of researchers employed by Dutch Universities that comply with the legal requirements of Article 25fa of the Dutch Copyright Act are distributed online and free of cost or other barriers in institutional repositories. Research outputs are distributed six months after their first online publication in the original published version and with proper attribution to the source of the original publication.You are permitted to download and use the publication for personal purposes. Please note that you are not allowed to share this article on other platforms, but can link to it. All rights remain with the author(s) and/or copyrights owner(s) of this work. Any use of the publication or parts of it other than authorised under this licence or copyright law is prohibited. Neither Radboud University nor the authors of this publication are liable for any damage resulting from your (re)use of this publication.If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the ma terial

show abstract

“…(Online) PRP/SPRPs such as Feistel [41,48,49], MHCBC and MCBC [50], (tweakable) even-Mansour [45,[51][52][53][54][55], FMix [56], OleF [57], two-round LDT [58], CLRW2 [59], etc. ;…”

mentioning

confidence: 99%

A Survey on Applications of H-Technique: Revisiting Security Analysis of PRP and PRF

Jha

Nandi

2022

Entropy

Self Cite

View full text Add to dashboard Cite

The Coefficients H technique (also called the H-technique), developed by Patarin circa 1991, is a tool used to obtain the upper bounds on distinguishing advantages. This tool is known to provide relatively simple and (in some cases) tight bound proofs in comparison to some other well-known tools, such as the game-playing technique and random systems methodology. In this systematization of knowledge (SoK) paper, we aim to provide a brief survey on the H-technique. The SoK is presented in four parts. First, we redevelop the necessary nomenclature and tools required to study the security of any symmetric-key design, especially in the H-technique setting. Second, we provide a full description of the H-technique and some related tools. Third, we present (simple) H-technique-based proofs for some popular symmetric-key designs, across different paradigms. Finally, we show that the H-technique can actually provide optimal bounds on distinguishing advantages.

show abstract

OleF: an Inverse-Free Online Cipher. An Online SPRP with an Optimal Inverse-Free Construction

Cited by 3 publications

References 8 publications

Permutation Based EDM: An Inverse Free BBB Secure PRF

Permutation Based EDM: An Inverse Free BBB Secure PRF

XOR of PRPs in a Quantum World

A Survey on Applications of H-Technique: Revisiting Security Analysis of PRP and PRF

Contact Info

Product

Resources

About