How to stretch random functions: The security of protected counter sums

DOI10.1007/S001459900051zbMath0937.94006OpenAlexW1966364100MaRDI QIDQ1304976

Daniel J. Bernstein

Publication date: 6 June 2000

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001459900051

zbMATH Keywords

provable securityunpredictabilityrandom functionoracle algorithmprotected counter sum

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (11)

PMAC with Parity: Minimizing the Query-Length Influence ⋮ An extension of Cook’s elasti cipher ⋮ Improved multi-user security using the squared-ratio method ⋮ Quantum linearization attacks ⋮ Fine-tuning the ISO/IEC standard \textsf{LightMAC} ⋮ On the security of keyed hashing based on public permutations ⋮ Revisiting Full-PRF-Secure PMAC and Using It for Beyond-Birthday Authenticated Encryption ⋮ A MAC Mode for Lightweight Block Ciphers ⋮ The Multi-user Security of Double Encryption ⋮ Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security ⋮ The summation-truncation hybrid: reusing discarded bits for free

This page was built for publication: How to stretch random functions: The security of protected counter sums