• Title/Summary/Keyword: Differential trails

Search Result 5, Processing Time 0.016 seconds

Efficient Differential Trail Searching Algorithm for ARX Block Ciphers (ARX 구조를 가지는 블록 암호에 대한 효율적인 차분 경로 자동 탐색 알고리즘)

  • Kim, Seojin;Kang, HyungChul;Hong, Deukjo;Sung, Jaechul;Hong, Seokhie
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.26 no.6
    • /
    • pp.1421-1430
    • /
    • 2016
  • In this paper, we suggest an advanced method searching for differential trails of block cipher with ARX structure. we use two techniques to optimize the automatic search algorithm of differential trails suggested by A. Biryukov et al, and obtain 2~3 times faster results than Biryukov's when implemented in block cipher SPECK. This results contribute to find better differential trails than previous results.

An Upper Bound of the Longest Impossible Differentials of Several Block Ciphers

  • Han, Guoyong;Zhang, Wenying;Zhao, Hongluan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.1
    • /
    • pp.435-451
    • /
    • 2019
  • Impossible differential cryptanalysis is an essential cryptanalytic technique and its key point is whether there is an impossible differential path. The main factor of influencing impossible differential cryptanalysis is the length of the rounds of the impossible differential trail because the attack will be more close to the real encryption algorithm with the number becoming longer. We provide the upper bound of the longest impossible differential trails of several important block ciphers. We first analyse the national standard of the Russian Federation in 2015, Kuznyechik, which utilizes the 16-byte LFSR to achieve the linear transformation. We conclude that there is no any 3-round impossible differential trail of the Kuznyechik without the consideration of the specific S-boxes. Then we ascertain the longest impossible differential paths of several other important block ciphers by using the matrix method which can be extended to many other block ciphers. As a result, we show that, unless considering the details of the S-boxes, there is no any more than or equal to 5-round, 7-round and 9-round impossible differential paths for KLEIN, Midori64 and MIBS respectively.

A Study on the Acceptance of Pop Musician's Image among Korean Adolescent: - Focusing on Subculture, Fan Costume play - (대중가수 이미지의 청소년 수용에 관한 연구 -팬코스프레 집단을 중심으로-)

  • 한자영;유송옥
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.28 no.5
    • /
    • pp.570-581
    • /
    • 2004
  • The purpose of this study is to analyze the acceptance and interpretation of pop musician's image in the Korean youth subculture, Fan Costume play(Fancos). Fancos subculture took the most active attitude to accepts of the pop musician's image and therefore was assumed to have various and differential acceptance aspects. The ethnographic method was used in order to approach more closely from their point of view. The cultural activity of Fancos subculture was imitation and reappearance of pop musician's appearance. Actually Fancos is a kind of fan-culture which idolized Korean pop music star. The acceptance of musician's appearance in Fancos is found out in two aspects. One is passive acceptance aspects that inforces conformity of star fashion and follows servilely ideal body image which promoted by cultural industry. The other is unique acceptance aspects that Fancos members interpret the musician's image in their own way. Those members experience pleasure through their own meaning. And homology of their appearance makes a distinction between of themselves from other youth and intensifies their group identity. As above analyzed, Fancos subculture has differential acceptance of pop music star's image comparing to other youth and even their stylistic appearance reflects not only their fandom but also their own meaning. Consequently, pop musician's image as a popular cultural text is accepted not equal to all populace but dissimilar along with contexts and trails of the acceptance group.

Potentiality of urban forest roads as an environment for enhancing physical fitness (건강증진 환경 조성을 위한 도시근교 임도의 활용 가능성)

  • Jeon, Yong-Jun;Choi, Yeon-ho;Kim, Myeong-Jun;Lee, Joon-Woo;Park, Bum-Jin
    • Korean Journal of Agricultural Science
    • /
    • v.38 no.1
    • /
    • pp.109-113
    • /
    • 2011
  • The purpose of this study was to examine the potentiality of urban forest roads as an environment for enhancing physical fitness. Six male university students participated in the study as subjects. The subjects walked on an urban forest road for 30 minutes. As a control experiment, they also walked on a national park trail for 30 minutes. Subjects' heart rates were monitored during the walks to calculate the ratio of the average time their heart rates were within the target range (from 60% to 80% of the maximal heart rate) for Enhancing Physical Fitness. After the walks, images of the spaces were analyzed using the semantic differential (SD) method. During the walk on the urban forest road, subjects' heart rates were within the target range 63.3% of the time, and lower than the target range 36.7% of the time. During the control experiment on the national park trail, subjects' heart rates were within the target range only 23.3% of the time, and higher than the target range 76.7% of the time. From the spatial perception evaluation using the SD method, subjects' comfortable and natural feelings when they were on the national park trail were significantly greater than when they were on the urban forest trail, but there were no differences in terms of other SD descriptors, such as friendliness and likeability. The results of our study indicate that the urban forest road provides a good environment for walking to enhance physical fitness. Although not as close to nature as national park trails, urban forest roads offer similar natural environments and have a high potentiality for serving as leisure spaces for urban residents who seek physical activities.

On Resistance of Bit Permutation Based Block Cipher against Nonlinear Invariant Attack (비트 순열 기반 블록암호의 비선형 불변 공격 저항성 연구)

  • Jeong, Keonsang;Kim, Seonggyeom;Hong, Deukjo;Sung, Jaechul;Hong, Seokhie
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.30 no.3
    • /
    • pp.325-336
    • /
    • 2020
  • Nonlinear Invariant Attack is an attack that should be considered when constructing lightweight block ciphers with relatively simple key schedule. A shortcut to prove a block cipher's resistance against nonlinear invariant attack is checking the smallest dimension of linear layer-invariant linear subspace which contains all known differences between round keys is equal to the block size. In this paper, we presents the following results. We identify the structure and number of optimal bit-permutations which require only one known difference between round keys for a designer to show that the corresponding block cipher is resistant against nonlinear invariant attack. Moreover, we show that PRESENT-like block ciphers need at least two known differences between round keys by checking all PRESENT-like bit-permutations. Additionally, we verify that the variants of PRESENT-like bit-permutations requiring the only two known differences between round keys do not conflict with the resistance against differential attack by comparing the best differential trails. Finally, through the distribution of the invariant factors of all bit-permutations that maintain BOGI logic with GIFT S-box, GIFT-variant block ciphers require at least 8 known differences between round keys for the resistance.