KATAN and KTANTAN - A Family of Small and Efficient Hardware-Oriented Block Ciphers
By Christophe De Cannière, Orr Dunkelman, Miroslav Knezevic. Workshop on Cryptographic Hardware and Embedded Systems, 2009
783 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition
View Paper: https://www.semanticscholar.org/paper/b3402624cde8378c6ddb33ebbe6e569dae0e7779
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Vishal A. Thakor
- Muhammad R. A. Khandaker
- Mohammad Abdur Razzaque
- Thomas Peyrin
- Axel York Poschmann
- Yosuke Todo
- Subhadeep Banik
- Jian Guo
In Computer Vision and Pattern Recognition
- Vishal A. Thakor
- Muhammad R. A. Khandaker
- Mohammad Abdur Razzaque
- Axel York Poschmann
- Thomas Peyrin
- Yee Wei Law
- Svetla Nikova
- Zheng Gong
Citations in the corpus
- Pushing the Limits: A Very Compact and a Threshold Implementation of AES (2011, methodology): “in implementations of PRESENT [30] and KATAN/KTANTAN [ 7 ].”
- SIMON and SPECK: Block Ciphers for the Internet of Things (2015, methodology): “This work has produced designs including PRESENT [17], KATAN [22], and [52], each of which has a very small hardware footprint.”
- KLEIN: A New Family of Lightweight Block Ciphers (2010, background): “In the literature, quite a few lightweight block ciphers with various design strategies have been proposed [3,6,13,18,22,27,33,35,42,52].”
- GIFT: A Small Present - Towards Reaching the Limit of Lightweight Encryption (2017, background): “There have been extensive research conducted in this direction, with countless new primitives being introduced [2,4, 5, 12,15,22,39], many of them getting broken rather rapidly (designing a cipher with strong constraints is not an easy task).”
- The SKINNY Family of Block Ciphers and its Low-Latency Variant MANTIS (2016, background): “In addition to its smaller key size, we note that KATAN-64-80 [9] theoretical area grade is slightly biased here as one round of this cipher is extremely light and such a round-based implementation would actually look more like a serial implementation and will have a very low throughput (KATAN-64-80”
- spongent: A Lightweight Hash Function (2011, background): “Once this research problem was identified, the cryptographic community designed a number of tailored lightweight cryptographic algorithms to specifically address this challenge: stream ciphers like Trivium [12,10], Grain [13,14], and Mickey [2] as well as block ciphers like SEA [26], DESL, DESXL [21”
- PRINCE - A Low-Latency Block Cipher for Pervasive Computing Applications - Extended Abstract (2012, methodology): “For the same time constraints and technologies, PRINCE uses 6-7 times less area than PRESENT-80 and 14-15 times less area than AES-128.”
- Lightweight Cryptography Algorithms for Resource-Constrained IoT Devices: A Review, Comparison and Research Opportunities (2021, methodology): “KATAN/KTANTAN [124], inspired by KeeLoq, cipher family applies 80-bit key on various block size (32-bit, 48-bit and 64-bit) through 254 iterations.”
- The PHOTON Family of Lightweight Hash Functions (2011, methodology): “P256 256 8 4 12 [0, 1, 3, 7, 15, 14, 12, 8] x 4 + x + 1 (2, 4, 2, 11, 2, 8, 5, 6)”
- The LED Block Cipher (2011, neutral): “18 402 387 KTANTAN64 [13] 80 64 255 25.”
- Piccolo: An Ultra-Lightweight Blockcipher (2011, methodology): “In a recent trend, the implementation of lightweight blockciphers uses a scan flip-flop instead of a combination of a D flip-flop and a 2-to-1 MUX [13,35,36] to reduce the gate requirement.”