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

DOI10.1007/S12095-017-0276-ZzbMath1423.94052OpenAlexW2784180455MaRDI QIDQ1749799

Srimanta Bhattacharya, Mridul Nandi

Publication date: 28 May 2018

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-017-0276-z

zbMATH Keywords

random permutationtotal variation distancepseudorandom functionPinsker's inequalityKL divergence\(\chi^{2}\) distancesum of random permutationtruncated random permutation

Mathematics Subject Classification ID

Applications of statistics in engineering and industry; control charts (62P30) General topics of discrete mathematics in relation to computer science (68R01) Cryptography (94A60) Combinatorial probability (60C05)

Related Items (6)

Luby-Rackoff backwards with more users and more security ⋮ Analysis of the single-permutation encrypted Davies-Meyer construction ⋮ Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model ⋮ Mind the composition: birthday bound attacks on EWCDMD and SoKAC21 ⋮ Leakage resilient value comparison with application to message authentication ⋮ The summation-truncation hybrid: reusing discarded bits for free

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate distributions of order statistics. With applications to nonparametric statistics
• ZMAC: a fast tweakable block cipher mode for highly secure message authentication
• Information-theoretic indistinguishability via the chi-squared method
• Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
• How many queries are needed to distinguish a truncated random permutation from a random function?
• The advantage of truncated permutations
• EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
• The Indistinguishability of the XOR of $$k$$ Permutations
• New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
• The “Coefficients H” Technique
• Distance between sampling with and without replacement
• On Choosing and Bounding Probability Metrics
• Elements of Information Theory
• A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
• On Information and Sufficiency

This page was built for publication: A note on the chi-square method: a tool for proving cryptographic security