TEA, a tiny encryption algorithm
From MaRDI portal
Cited in
(41)- The Missing Difference problem, and its applications to counter mode encryption
- Zero-correlation attacks: statistical models independent of the number of approximations
- sLiSCP: Simeck-based permutations for lightweight sponge cryptographic primitives
- A single-key attack on the full GOST block cipher
- On the implementation efficiency of linear regression-based side-channel attacks
- A bit-vector differential model for the modular addition by a constant and its applications to differential and impossible-differential cryptanalysis
- Verifying constant-time implementations by abstract interpretation
- System-level non-interference of constant-time cryptography. II: Verified static analysis and stealth memory
- New results on the genetic cryptanalysis of TEA and reduced-round versions of XTEA
- Revisiting key schedule's diffusion in relation with round function's diffusion
- Proof producing synthesis of arithmetic and cryptographic hardware
- Software obfuscation with non-linear mixed Boolean-arithmetic expressions
- A bit-vector differential model for the modular addition by a constant
- Arithmetic Addition over Boolean Masking
- Construction of lightweight S-boxes using Feistel and MISTY structures
- Automatic differential analysis of ARX block ciphers with application to SPECK and LEA
- Automatic search of linear trails in ARX with applications to SPECK and Chaskey
- LBlock: a lightweight block cipher
- Meet-in-the-middle attacks on reduced-round XTEA
- Related-Key Cryptanalysis of Midori
- SEA: A Scalable Encryption Algorithm for Small Embedded Applications
- Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
- Differential Cryptanalysis of Reduced-Round PRESENT
- The Hash Function Family LAKE
- A Unified Approach to Related-Key Attacks
- Non-standard Attacks against Cryptographic Protocols, with an Example over a Simplified Mutual Authentication Protocol
- Lightweight Block Ciphers Revisited: Cryptanalysis of Reduced Round PRESENT and HIGHT
- Formal verification for high-assurance behavioral synthesis
- \(\mathsf{xmx}\): a firmware-oriented block cipher based on modular multiplications
- Sliding encryption: a cryptographic tool for mobile agents
- AKF: a key alternating Feistel scheme for lightweight cipher designs
- Analysis of bitsum attack on block ciphers
- scientific article; zbMATH DE number 7310237 (Why is no real title available?)
- TEA
- Chai-Tea, Cryptographic Hardware Implementations of xTEA
- Rotational differential-linear distinguishers of ARX ciphers with arbitrary output linear masks
- Pseudo-random number generation for Brownian dynamics and dissipative particle dynamics simulations on GPU devices
- Calculation of the differential probabilities for the sum of k numbers modulo 2ⁿ
- On ARX-like ciphers based on different codings of 2-groups with a cyclic subgroup of index 2
- Forking sums of permutations for highly secure and efficient PRFs
- \textsf{MSX}: lightweight block ciphers for microcontrollers with high-assurance against differential and linear attacks
This page was built for publication: TEA, a tiny encryption algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4484891)
