An overview of side channel analysis attacks
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Cube Attacks on Tweakable Black Box Polynomials
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Cube Testers and Key Recovery Attacks on Reduced-Round MD6 and Trivium
Fast Software Encryption
Side Channel Cube Attack on PRESENT
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Hummingbird: ultra-lightweight cryptography for resource-constrained devices
FC'10 Proceedings of the 14th international conference on Financial cryptograpy and data security
Extended cubes: enhancing the cube attack by extracting low-degree non-linear equations
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Breaking Grain-128 with dynamic cube attacks
FSE'11 Proceedings of the 18th international conference on Fast software encryption
Cryptanalysis of Hummingbird-1
FSE'11 Proceedings of the 18th international conference on Fast software encryption
On the security of NOEKEON against side channel cube attacks
ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
The hummingbird-2 lightweight authenticated encryption algorithm
RFIDSec'11 Proceedings of the 7th international conference on RFID Security and Privacy
| Hi-index | 0.00 |
Hummingbird-2 is a recently proposed ultra-lightweight cryptographic algorithm targeted for resource-constrained devices like RFID tags, smart cards, and wireless sensor nodes. In this paper, we address the security of the Hummingbird-2 cipher against side channel cube attacks under the single-bit-leakage model. To this end, we describe an efficient term-by-term quadraticity test for extracting simple quadratic equations besides linear ones, obtainable from the original cube attack proposed by Dinur and Shamir at EUROCRYPT 2009. Moreover, we accelerate the implementation of the proposed term-by-term quadraticity test by fully exploiting the power of a Graphic Processing Unit (GPU). Our experimental results show that using a single bit of the internal state during the initialization process of the Hummingbird-2 cipher we can recover the 48 out of 128 key bits of the Hummingbird-2 with a data complexity of about 218 chosen plaintexts.