Fast Software Encryption

DOI10.1007/b98177zbMath1079.68552OpenAlexW2485295499MaRDI QIDQ5713918

Stefan Lucks

Publication date: 27 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

block cipherspseudorandom functionsprovable securityrelated-key attacksconcrete security

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Theory of software (68N99)

Related Items

Relations between robustness and RKA security under public-key encryption, Non-malleable functions and their applications, Security Against Related Randomness Attacks via Reconstructive Extractors, Connecting tweakable and multi-key blockcipher security, Secure Message Authentication Against Related-Key Attack, The Chaining Lemma and Its Application, On the Notions of PRP-RKA, KR and KR-RKA for Block Ciphers, Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience, On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model, Subversion-resilient signatures: definitions, constructions and applications, Bounded tamper resilience: how to go beyond the algebraic barrier, Non-malleable Codes with Split-State Refresh, Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions, Notions and relations for RKA-secure permutation and function families, Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?, Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?, Clever Arbiters Versus Malicious Adversaries, Expedient Non-malleability Notions for Hash Functions, Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman, On Related-Secret Pseudorandomness, Delayed-Key Message Authentication for Streams, Analyzing the provable security bounds of GIFT-COFB and Photon-Beetle