HIGHT: A New Block Cipher Suitable for Low-Resource Device

Hong, Deukjo; Sung, Jaechul; Hong, Seokhie; Lim, Jongsik; Lee, Sang-Jin; Koo, Bon-Seok; Lee, Chang‐Hoon; Chang, Donghoon; Lee, Jesang; Jeong, Kwang Seob; Kim, Hyun; Kim, Jongsung; Chee, Seongtaek

doi:10.1007/11894063_4

Cited by 505 publications

(332 citation statements)

References 19 publications

Supporting

Mentioning

331

Contrasting

Unclassified

Order By: Relevance

“…Our result enables us to build a secure GFS cipher having a fewer rounds than Type-II without increasing the implementation cost. From practical viewpoint, the primal application of our result would be the construction of small-scale block ciphers, where many ciphers are recently proposed in this category [4] [11]. Additionally, it will also be useful to build large-block ciphers, such as 256 or 512-bit block.…”

Section: Introductionmentioning

confidence: 93%

“…Recently, Type-II GFS receives a lot of attention for its simplicity and high parallelism. We have some modern Type-II-based block ciphers, e.g., CLEFIA [25] (k = 4), and HIGHT [11] (k = 8). When the length of message is fixed, the width (i.e., I/O lengths) of round function gets shorter as the partition number grows.…”

Section: Introductionmentioning

confidence: 99%

“…1 {3,0,7,2,9,4,11,8,5,10,1,6} {1,10,3,0,5,8,11,2,7,4,9 1,4,7,2,11,8,9,10,5,6} {1,2,5,0,3,10,11,4,7,8,9,6} 8 14 15 37 37 No.14 {3,0, 7,4,9,2,11,8,1,10,5,6} {1,8,5,0,3,10,11,2,7,4,9,6} 8 14 15 34 33 No.15 {3,0,7,4,11,2,1,8,9,10,5,6} {1,6,5,0,3,10,11,2,7,8,9,4} 8 14 14/15 28 28 No.16 {3,0,7,4,11,2,5,8,1,…”

mentioning

confidence: 99%

See 2 more Smart Citations

Improving the Generalized Feistel

Suzaki

Minematsu

2010

Lecture Notes in Computer Science

100

126

View full text Add to dashboard Cite

Abstract. The generalized Feistel structure (GFS) is a generalized form of the classical Feistel cipher. A popular version of GFS, called Type-II, divides a message into k > 2 sub blocks and applies a (classical) Feistel transformation for every two sub blocks, and then performs a cyclic shift of k sub blocks. Type-II GFS has many desirable features for implementation. A drawback, however, is its low diffusion property with a large k. This weakness can be exploited by some attacks, such as impossible differential attack. To protect from them, Type-II GFS generally needs a large number of rounds.In this paper, we improve the Type-II GFS's diffusion property by replacing the cyclic shift with a different permutation. Our proposal enables to reduce the number of rounds to attain a sufficient level of security. Thus, we improve the security-efficiency treading off of Type-II GFS. In particular, when k is a power of two, we obtain a significant improvement using a highly effective permutation based on the de Bruijn graph.

show abstract

Section: Introductionmentioning

confidence: 93%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Improving the Generalized Feistel

Suzaki

Minematsu

2010

Lecture Notes in Computer Science

100

126

View full text Add to dashboard Cite

show abstract

“…Note that in order to maintain consistency of presentation throughout the thesis, the description below is different from (but equivalent to) that given in [37]; in particular, we use a different numbering of the bits of a value.…”

Section: The Hight Block Ciphermentioning

confidence: 99%

Cryptanalysis on Block Ciphers

Sakiyama

Sasaki

2015

Security of Block Ciphers

View full text Add to dashboard Cite

“…XTEA is vulnerable to related key differential attack. Like SEA, HIGHT [12] is also another Block Cipher for resource constrained systems, but it is non-scalable and consumes more number of gates and the throughput and operating frequency are much less when compared to SEA. So, implementing SEA for constrained systems is a better option.…”

Section: Related Workmentioning

confidence: 99%

Efficient Modular Adders for Scalable Encryption Algorithm

Kumar¹,

Kesava²,

Salivahanan³

2011

IJCA

View full text Add to dashboard Cite

SEA -Scalable Encryption Algorithm is a block cipher based symmetric encryption scheme, specially designed for resource constrained devices. SEA proposes low computational encryption routines (i.e. less code size, memory and power) for processors with a restricted instruction set. SEA is parametric with plain-text, key and microprocessor size, and meant for efficient combination of encryption/decryption and key derivation. The performance of modified SEA using efficient architectures of 2 b and 2 b -1 modular adders in a Field programmable gate array (FPGA) device is investigated. In this paper, an iterative based loop design of the block cipher is first implemented on FPGA. The proposed modular adders in SEA achieve lower area and power consumption on the target platform VIRTEX-4, xc4vl25-10ff668. Beyond its low cost performances, the proposed architecture is fully flexible with any parameters and takes advantage of generic VHDL coding.

show abstract

HIGHT: A New Block Cipher Suitable for Low-Resource Device

Cited by 505 publications

References 19 publications

Improving the Generalized Feistel

Improving the Generalized Feistel

Cryptanalysis on Block Ciphers

Efficient Modular Adders for Scalable Encryption Algorithm

Contact Info

Product

Resources

About