Fast Software Encryption
From MaRDI portal
Publication:5713917
DOI10.1007/b98177zbMath1079.68559OpenAlexW2485295499MaRDI QIDQ5713917
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
Related Items (42)
Algorithmic problems in the symbolic approach to the verification of automatically synthesized cryptosystems ⋮ Hidden shift quantum cryptanalysis and implications ⋮ Optimizing Online Permutation-Based AE Schemes for Lightweight Applications ⋮ Rogue Decryption Failures: Reconciling AE Robustness Notions ⋮ Security of public key encryption against resetting attacks ⋮ Hiding in plain sight: memory-tight proofs via randomness programming ⋮ Attacks and Security Proofs of EAX-Prime ⋮ On Symmetric Encryption with Distinguishable Decryption Failures ⋮ Cryptanalysis of the AEAD and hash algorithm DryGASCON ⋮ A practical forgery attack on Lilliput-AE ⋮ Integrity Analysis of Authenticated Encryption Based on Stream Ciphers ⋮ How to backdoor (classic) McEliece and how to guard against backdoors ⋮ Authenticated Encryption Mode for Beyond the Birthday Bound Security ⋮ О стойкости режима аутентифицированного шифрования с дополнительными данными MGM к угрозе нарушения конфиденциальности;On the security of authenticated encryption mode with associated data MGM with respect to confidentiality threat ⋮ Authenticated Encryption with Variable Stretch ⋮ On the related-key attack security of authenticated encryption schemes ⋮ Authenticated encryption with key identification ⋮ Overloading the nonce: rugged PRPs, nonce-set AEAD, and order-resilient channels ⋮ Anonymous whistleblowing over authenticated channels ⋮ ParaDiSE: efficient threshold authenticated encryption in fully malicious model ⋮ Full Disk Encryption: Bridging Theory and Practice ⋮ Revisiting Full-PRF-Secure PMAC and Using It for Beyond-Birthday Authenticated Encryption ⋮ Simulatable channels: extended security that is universally composable and easier to prove ⋮ Unnamed Item ⋮ RIV for Robust Authenticated Encryption ⋮ Grey-Box Steganography ⋮ Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector ⋮ A Provable-Security Treatment of the Key-Wrap Problem ⋮ Nonce-Based Key Agreement Protocol Against Bad Randomness ⋮ A New Mode of Operation for Incremental Authenticated Encryption with Associated Data ⋮ The \texttt{Deoxys} AEAD family ⋮ Cryptanalysis of OCB2: attacks on authenticity and confidentiality ⋮ Practical significance of security bounds for standardized internally re-keyed block cipher modes ⋮ How much data may be safely processed on one key in different modes? ⋮ The Counter mode with encrypted nonces and its extension to authenticated encryption ⋮ Efficient Beyond-Birthday-Bound-Secure Deterministic Authenticated Encryption with Minimal Stretch ⋮ Authenticated Encryption with Small Stretch (or, How to Accelerate AERO) ⋮ PolyE+CTR: A Swiss-Army-Knife Mode for Block Ciphers ⋮ Cryptanalysis of the Light-Weight Cipher A2U2 ⋮ Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers ⋮ The memory-tightness of authenticated encryption ⋮ Analyzing the provable security bounds of GIFT-COFB and Photon-Beetle
This page was built for publication: Fast Software Encryption
