TNT: how to tweak a block cipher

Z Bao, C Guo, J Guo, L Song - … International Conference on the Theory and …, 2020 - Springer
In this paper, we propose Tweak-aNd-Tweak (TNT TNT for short) mode, which builds a
tweakable block cipher from three independent block ciphers. TNT TNT handles the tweak …

Generalized feistel structures based on tweakable block ciphers

K Nakaya, T Iwata - IACR Transactions on Symmetric Cryptology, 2022 - tosc.iacr.org
A generalized Feistel structure (GFS) is a classical approach to construct a block cipher from
pseudorandom functions (PRFs). Coron et al. at TCC 2010 instantiated a Feistel structure …

A note on the chi-square method: A tool for proving cryptographic security

S Bhattacharya, M Nandi - Cryptography and Communications, 2018 - Springer
Very recently (in CRYPTO 2017) Dai, Hoang, and Tessaro have introduced the Chi-square
method (χ 2 method) which can be applied to obtain an upper bound on the statistical …

Populating the Zoo of Rugged Pseudorandom Permutations

JP Degabriele, V Karadžić - International Conference on the Theory and …, 2023 - Springer
Abstract A Rugged Pseudorandom Permutation (RPRP) is a variable-input-length tweakable
cipher satisfying a security notion that is intermediate between tweakable PRP and …

Towards Minimizing Tweakable Blockcipher-Based Generalized Feistel Networks

Y Zhao, C Guo - International Conference on Cryptology in India, 2023 - Springer
A generalized Feistel network (GFN) is a classical approach to constructing a blockcipher
from pseudorandom functions (PRFs). Recently, Nakaya and Iwata (ToSC, 2022) formalized …

Chi-square method

M NANDI - Symmetric Cryptography, Volume 1: Design and …, 2023 - books.google.com
Different tools from probability and statistics are now heavily used in cryptography. Among
them, the χ2-method is a recent addition in cryptographic literature. The idea was introduced …

Iterative block ciphers from tweakable block ciphers with long tweaks

R Nakamichi, T Iwata - IACR Transactions on Symmetric Cryptology, 2019 - tosc.iacr.org
We consider a problem of constructing a secure block cipher from a tweakable block cipher
(TBC) with long tweaks. Given a TBC with n-bit blocks and Γn-bit tweaks for Γ≥ 1, one of the …

[PDF][PDF] Deck-based wide block cipher modes and an exposition of the blinded keyed hashing model

A Gunsing, J Daemen, BJM Mennink - 2019 - repository.ubn.ru.nl
We present two tweakable wide block cipher modes from doubly-extendable cryptographic
keyed (deck) functions and a keyed hash function: double-decker and docked-double …

A survey on applications of H-technique: Revisiting security analysis of PRP and PRF

A Jha, M Nandi - Entropy, 2022 - mdpi.com
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 …

Beyond-birthday-bound secure cryptographic permutations from ideal ciphers with long keys

R Nakamichi, T Iwata - IACR Transactions on Symmetric Cryptology, 2020 - tosc.iacr.org
Coron et al. showed a construction of a 3-round 2n-bit cryptographic permutation from three
independent n-bit ideal ciphers with n-bit keys (TCC 2010). Guo and Lin showed a …