Fast Software Encryption
From MaRDI portal
Publication:5473578
DOI10.1007/b137506zbMath1140.68382OpenAlexW4214882369WikidataQ28000487 ScholiaQ28000487MaRDI QIDQ5473578
Publication date: 22 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b137506
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Theory of software (68N99)
Related Items
Another Look at Tightness, Variants of Wegman-Carter message authentication code supporting variable tag lengths, HalftimeHash: modern hashing without 64-bit multipliers or finite fields, On modes of operations of a block cipher for authentication and authenticated encryption, Variationally universal hashing, Partition oracles from weak key forgeries, Incremental cryptography revisited: PRFs, nonces and modular design, Optimal forgeries against polynomial-based MACs and GCM, The Missing Difference problem, and its applications to counter mode encryption, CBCR: CBC MAC with rotating transformations, Efficient schemes for committing authenticated encryption, A new multi-linear universal hash family, Connecting tweakable and multi-key blockcipher security, TweetNaCl: A Crypto Library in 100 Tweets, On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes, Integrity Analysis of Authenticated Encryption Based on Stream Ciphers, Latin dances reloaded: improved cryptanalysis against Salsa and ChaCha, and the proposal of Forró, Latin dances reloaded: improved cryptanalysis against Salsa and ChaCha, and the proposal of Forró, Moving a step of ChaCha in syncopated rhythm, Quantum linearization attacks, Building blocks of sharding blockchain systems: concepts, approaches, and open problems, On weak keys and forgery attacks against polynomial-based MAC schemes, Semantic foundations for cost analysis of pipeline-optimized programs, Universal hashing based on field multiplication and (near-)MDS matrices, On the security of keyed hashing based on public permutations, A trade-off between collision probability and key size in universal hashing using polynomials, Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security, On Efficient Message Authentication Via Block Cipher Design Techniques, Evaluating Bernstein-Rabin-Winograd polynomials, Concealment and Its Applications to Authenticated Encryption, Related-Key Almost Universal Hash Functions: Definitions, Constructions and Applications, The design and evolution of OCB, The Software Performance of Authenticated-Encryption Modes, Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector, Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms, Toward Acceleration of RSA Using 3D Graphics Hardware, The circulant hash revisited, Improved linear approximations to ARX ciphers and attacks against ChaCha, PolyE+CTR: A Swiss-Army-Knife Mode for Block Ciphers, Poly1305-AES, Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal, EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC, A quantum hash function with grouped coarse-grained boson sampling, Single-trace side-channel analysis on polynomial-based MAC schemes, Quantum key distribution using universal hash functions over finite fields
