A measure of dependence for cryptographic primitives relative to ideal functions

DOI10.1216/RMJ-2015-45-4-1283zbMath1362.94054OpenAlexW1946568258MaRDI QIDQ888120

Cristina Tone, Daniel Smith-Tone

Publication date: 4 November 2015

Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.rmjm/1446472435

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Improved indifferentiability security bound for the JH mode ⋮ Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier

Uses Software

• Skein Hash

Cites Work

• Improved indifferentiability security bound for the JH mode
• Markov chains and stochastic stability
• Renewal theory properties of ion channels
• A limit theorem for turbulent diffusion
• A CENTRAL LIMIT THEOREM AND A STRONG MIXING CONDITION
• Approximately optimal memoryless detection of random signals in dependent noise (Corresp.)
• Provable Security of BLAKE with Non-ideal Compression Function
• Mixing Conditions for Markov Chains
• More Birthday Surprises
• Regression Theory for Near-Integrated Time Series
• Merkle-Damgård Revisited: How to Construct a Hash Function
• On the Indifferentiability of the Sponge Construction
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A measure of dependence for cryptographic primitives relative to ideal functions