• Title/Summary/Keyword: 다중 선형 공격

Search Result 5, Processing Time 0.015 seconds

New Multiple Linear Cryptanalysis of Block Ciphers (블록암호에 대한 새로운 다중선형공격법)

  • Hong, Deuk-Jo;Sung, Jae-Chul;Lee, Sang-Jin;Hong, Seok-Hie
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.17 no.6
    • /
    • pp.11-18
    • /
    • 2007
  • Multiple linear cryptanalysis has been researched as a method building up the linear attack strength. We indicate that the lastest linear attack algorithm using multiple approximations, which was proposed by Biryukov et al. is hardly applicable to block ciphers with highly nonlinear key schedule, and propose a new multiple linear attack algorithm. Simulation of the new attack algorithm with a small block cipher shows that theory for the new multiple linear cryptanalysis works well in practice.

Multiple Linear Cryptanalysis-Revisited (블록 암호에 대한 효율적인 선형 공격 방법)

  • Choi, Jun;Hong, Deuk-Jo;Hong, Seok-Hee;Lee, Sang-Jin;Im, Jong-In
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.12 no.6
    • /
    • pp.59-69
    • /
    • 2002
  • Many Linear attacks have introduced after M. Matsui suggested Linear Cryptanalysis in 1993. The one of them is the method suggested by B. Kaliski and M. Robshaw. It was a new method using multiple linear approximations to attack for block ciphers. It requires less known plaintexts than that of Linear Cryptanalysis(LC) by Matsui, but it has a problem. In this paper, we will introduce the new method using multiple linear approximation that can solve the problem. Using the new method, the requirements of the known plaintexts is 5(1.25) times as small as the requirements in LC on 8(16) round DES with a success rate of 95%(86%) respectively. We can also adopt A Chosen Plaintext Linear Attack suggested by L. R. Knudsen and J. E. Mathiassen and then our attack requires about $2^{40.6}$ chosen plaintexts to recover 15 key bits with 86% success rate. We believe that the results in this paper contain the fastest attack on the DES full round reported so far in the open literature.

The Effect of Factors on Aggression in Adolescents: Focusing on Individual, Parent, Friend Factors and SNS Usage (청소년의 공격성에 영향을 미치는 요인: 개인·부모·친구 요인과 소셜네트워크서비스(SNS) 이용 정도를 중심으로)

  • Lee, Yejin;Kim, Kyong-Beom;Heo, Min-Hee;Noh, Jin-Won;Im, Yu-Mi
    • The Journal of the Korea Contents Association
    • /
    • v.21 no.4
    • /
    • pp.699-706
    • /
    • 2021
  • This study aims to identify the effects of factors on aggression in adolescents, focusing on the individual, parent, friend factors and SNS usage. In particular, this study is to provide a basis for easing aggression in adolescence by considering the emotional relationship of parents and friends. This study analyzed frequency, t-test, one-way batch distribution analysis(ANOVA), and multi-linear regression, using the data from the 7th year of the Korean Children and Youth Panel Survey. As a result, adolescents who frequently use SNS are more aggressive than adolescents who use less. Among the parental factors, the more abuse and excessive interference were found to be more aggressive, and the higher the coach, the lower the aggressiveness. Furthermore, among the friend factors, it has been shown that the higher the alienation, the more aggressive adolescents are. In order to reduce aggression among adolescents, it is necessary to prepare an integrated program considering the emotional relationship of parents and friends, who are the most influential neighbors, rather than simply restricting the use of SNS.

Hybrid Asymmetric Watermarking using Correlation and Critical Criteria (상관도와 임계치 방식을 이용한 다중검출 비대칭 워터마킹)

  • Li De;Kim Jong-Weon;Choi Jong-Uk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7C
    • /
    • pp.726-734
    • /
    • 2005
  • Traditional watermarking technologies are symmetric method which embedding and detection keys are the same. Although the symmetric watermarking method is easy to detect the watermark, this method has weakness against to malicious attacks remove or modify the watermark information when the symmetric key is disclosure. Recently, the asymmetric watermarking method that has different keys to embed and detect is watched by several researchers as a next generation watermarking technology. In this paper, hybrid asymmetric watermarking algorithm is proposed. This algorithm is composed of correlation detection method and critical criteria method. Each method can be individually used to detect watermark from a watermarked content. Hybrid asymmetric detection is complement between two methods, and more feasible than when each method is used respectively, Private key and public key are generated by secure linear transformation and specific matrix. As a result, we have proved the proposed algorithm is secured than symmetric watermarking algorithms. This algorithm can expand to multi bits embedding watermark system and is robust to JPEG and JPEG2000 compression.

An Efficient Post-Quantum Signature Scheme Based on Multivariate-Quadratic Equations with Shorter Secret Keys (양자컴퓨터에 안전한 짧은 비밀키를 갖는 효율적인 다변수 이차식 기반 전자서명 알고리즘 설계)

  • Kyung-Ah Shim
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.33 no.2
    • /
    • pp.211-222
    • /
    • 2023
  • Multivariate quadratic equations (MQ)-based public-key cryptographic algorithms are one of promising post-quantumreplacements for currently used public-key cryptography. After selecting to NIST Post-Quantum Cryptography StandardizationRound 3 as one of digital signature finalists, Rainbow was cryptanalyzed by advanced algebraic attacks due to its multiple layered structure. The researches on MQ-based schemes are focusing on UOV with a single layer. In this paper, we propose a new MQ-signature scheme based on UOV using the combinations of the special structure of linear equations, spare polynomials and random polynomials to reduce the secret key size. Our scheme uses the block inversion method using half-sized blockmatrices to improve signing performance. We then provide security analysis, suggest secure parameters at three security levels and investigate their key sizes and signature sizes. Our scheme has the shortest signature length among post-quantumsignature schemes based on other hard problems and its secret key size is reduced by up to 97% compared to UOV.