The following pages link to Fast Software Encryption (Q5473578):
Displayed 45 items.
- Poly1305-AES (Q38477) (← links)
- On modes of operations of a block cipher for authentication and authenticated encryption (Q301626) (← links)
- CBCR: CBC MAC with rotating transformations (Q350985) (← links)
- A new multi-linear universal hash family (Q369419) (← links)
- Variants of Wegman-Carter message authentication code supporting variable tag lengths (Q831162) (← links)
- HalftimeHash: modern hashing without 64-bit multipliers or finite fields (Q832844) (← links)
- Variationally universal hashing (Q845822) (← links)
- On weak keys and forgery attacks against polynomial-based MAC schemes (Q901368) (← links)
- Optimal forgeries against polynomial-based MACs and GCM (Q1648808) (← links)
- The Missing Difference problem, and its applications to counter mode encryption (Q1648860) (← links)
- Evaluating Bernstein-Rabin-Winograd polynomials (Q1727367) (← links)
- The design and evolution of OCB (Q1983331) (← links)
- Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector (Q2016427) (← links)
- The circulant hash revisited (Q2033521) (← links)
- Improved linear approximations to ARX ciphers and attacks against ChaCha (Q2056712) (← links)
- A quantum hash function with grouped coarse-grained boson sampling (Q2102295) (← links)
- Single-trace side-channel analysis on polynomial-based MAC schemes (Q2106682) (← links)
- Quantum key distribution using universal hash functions over finite fields (Q2107057) (← links)
- Partition oracles from weak key forgeries (Q2149813) (← links)
- Incremental cryptography revisited: PRFs, nonces and modular design (Q2152052) (← links)
- Efficient schemes for committing authenticated encryption (Q2170073) (← links)
- Connecting tweakable and multi-key blockcipher security (Q2413014) (← links)
- A trade-off between collision probability and key size in universal hashing using polynomials (Q2430412) (← links)
- Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security (Q2690521) (← links)
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC (Q2835585) (← links)
- Another Look at Tightness (Q2889878) (← links)
- TweetNaCl: A Crypto Library in 100 Tweets (Q2946467) (← links)
- On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes (Q2946883) (← links)
- Integrity Analysis of Authenticated Encryption Based on Stream Ciphers (Q2953865) (← links)
- Concealment and Its Applications to Authenticated Encryption (Q3000035) (← links)
- The Software Performance of Authenticated-Encryption Modes (Q3013091) (← links)
- PolyE+CTR: A Swiss-Army-Knife Mode for Block Ciphers (Q3092364) (← links)
- Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal (Q3104710) (← links)
- Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms (Q3600218) (← links)
- Related-Key Almost Universal Hash Functions: Definitions, Constructions and Applications (Q4639496) (← links)
- On Efficient Message Authentication Via Block Cipher Design Techniques (Q5387102) (← links)
- Toward Acceleration of RSA Using 3D Graphics Hardware (Q5448549) (← links)
- Latin dances reloaded: improved cryptanalysis against Salsa and ChaCha, and the proposal of Forró (Q6110382) (← links)
- Latin dances reloaded: improved cryptanalysis against Salsa and ChaCha, and the proposal of Forró (Q6135399) (← links)
- Moving a step of ChaCha in syncopated rhythm (Q6145948) (← links)
- Quantum linearization attacks (Q6157500) (← links)
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems (Q6158770) (← links)
- Semantic foundations for cost analysis of pipeline-optimized programs (Q6164437) (← links)
- Universal hashing based on field multiplication and (near-)MDS matrices (Q6186343) (← links)
- On the security of keyed hashing based on public permutations (Q6186773) (← links)