Linear Cryptanalysis on SPECTR-H64 with Higher Order Differential Property

Ko, Youngdai; Hong, Deukjo; Hong, Seokhie; Lee, Sang-Jin; Lim, Jongsik

doi:10.1007/978-3-540-45215-7_25

Cited by 18 publications

(9 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To thwart DCA-based attack more rounds should be performed. Comparison of earlier results on LCA and DCA of CIKS-1 [19], DDP-64 [20], Spectr-H64 [21], [11] and Cobra-H64 [12] shows that DCA is also more powerful against these DDP-based ciphers than linear one, the DDP boxes are linear primitive though. This is explained by the existence of the single linear characteristic for the DDP-box operations, which includes the sum of all bits of the transformed data block.…”

Section: /64mentioning

confidence: 94%

Controlled elements for designing ciphers suitable to efficient VLSI implementation

Moldovyan¹,

Moldovyan²,

Sklavos

2006

Telecommun Syst

View full text Add to dashboard Cite

This work considers the problem of increasing the performance of the ciphers based on Data-Dependent (DD) operations (DDO) for VLSI implementations. New minimum size primitives are proposed to design DDOs. Using advanced DDOs instead of DD permutations (DDP) in the DDP-based iterative ciphers Cobra-H64 and Cobra-H128 the number of rounds has been significantly reduced yielding enhancement of the "performance per cost" value and retaining security at the level of indistinguishability from a random transformation. To obtain further enhancement of this parameter a new crypto-scheme based on the advanced DDOs is proposed. The FPGA implementation of the proposed crypto-scheme achieves higher throughput value and minimizes the allocated resources than the conventional designs. Design of the DDO boxes of different orders is considered and their ASIC implementation is estimated.

show abstract

Section: /64mentioning

confidence: 94%

Controlled elements for designing ciphers suitable to efficient VLSI implementation

Moldovyan¹,

Moldovyan²,

Sklavos

2006

Telecommun Syst

View full text Add to dashboard Cite

show abstract

“…Its (0) is specified as follows: (1, 4, 7, 2, 5, 8, 3, 6) (9, 12, 15, 10, 13, 16, The involution I is described with two rotations by 8 bits: 16 . Lastly, as depicted in Fig.3(a), the F -box comprises two three-layer CP boxes P 32/48 and P −1 32/48 separated with fixed permutation which is described as follows: (1, 33) (2, 9)(3, 17)(4, 25)(5)(6, 13)(7, 21)(8, 34, 29, 4 0) (10, 35) (11,18) Table 3. Here, if e = 0 (encryption), …”

Section: Description Of Ddp-64mentioning

confidence: 99%

Security analysis of pure DDP-based cipher proper for multimedia and ubiquitous device

Lee

Park

et al. 2010

Telecommun Syst

Self Cite

View full text Add to dashboard Cite

DDP-64, based on various controlled operations, is a 64-bit Feistel-like block cipher consisting of 10 rounds with a 128-bit key. It was designed to attempt to have a high security level and a high speed performance in hardware on ubiquitous computing systems and multimedia. In this paper, however, we show that DDP-64 doesn't have a high security level, more precisely, we show that it is vulnerable to related-key differential attack. This attack, which is much faster than the key exhaustive search, requires about 2 54 data and 2 54 time complexities. This work is the first known cryptanalytic result on DDP-64 so far.

show abstract

“…With similar methods, we suggest a related key differential attack on full-round CIKS-1. This attack allows us to recover the 32-bit final round key of CIKS-1 with an expected success rate 80% and requires about 2 4 plaintext pairs and 2 33 encryption times. …”

Section: Introductionmentioning

confidence: 99%

Related Key Differential Cryptanalysis of Full-Round SPECTR-H64 and CIKS-1

Ko¹,

Lee²,

Hong³

et al. 2004

Information Security and Privacy

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper we show an attack on full-round SPECTR H64 and CIKS-1 using related key differential characteristic, which are based on data-dependent rotation with simple key schedule. To find partial 35-bit subkeys of SPECTR-H64 it needs about 2 23 data and 2 16encryptions with an expected success probability 95.8%. As for CIKS-1, 2 4 data and 2 33 encryptions are requried to find the final round key of it with an expected success probability 80%.

show abstract

Linear Cryptanalysis on SPECTR-H64 with Higher Order Differential Property

Cited by 18 publications

References 5 publications

Controlled elements for designing ciphers suitable to efficient VLSI implementation

Controlled elements for designing ciphers suitable to efficient VLSI implementation

Security analysis of pure DDP-based cipher proper for multimedia and ubiquitous device

Related Key Differential Cryptanalysis of Full-Round SPECTR-H64 and CIKS-1

Contact Info

Product

Resources

About