The Algeblaic Degree and Security of Generalized PURE Ciphers

スポンサーリンク

概要

• 論文の詳細を見る

• We estimated and calculated values of the algebraic degree of the generalized PURE ciphers which round functions are defined as y=(x+_2K)^<2^t+1>. The algebraic degree of the generalized PURE ciphers is nearly proportion to the number of rounds. The proportionality constant increases as the exponent 2^t+1 increases. The algebraic degree of block ciphers is an important characteristic which is used to estimate the security against the higher order differential attack. However the generalized PURE ciphers are well known as to be provable secure against the differential and linear cryptanalysis but judging from the obtained results of the algebraic degree, the generalized PURE ciphers are not so strong to the higher order differential attack.

• 社団法人電子情報通信学会の論文
• 1998-12-11

著者

• Kaneko Toshinobu

  Department Of Electrical Engineering Faculty Of Science And Technology

• Kaneko Toshinobu

  Department Of Electrical Engineering Science University Of Tokyo

• Kaneko Yasuyoshi

  Yokohama Research center Telecommunications Advancement Organization of Japan

• Kaneko Toshinobu

  Department Of Electric Engineering Science University Of Tokyo

• Kaneko Toshinobu

  Department of Electrical Engineering, Science University of TOKYO

関連論文

• Lowering the Error Floors of Irregular LDPC Code on Fast Fading Environment with Perfect and Imperfect CSIs(Wireless Communication Technologies)
• A Study on Higher Order Differential Attack of KASUMI(Symmetric Cryptography,Cryptography and Information Security)
• Security Enhancement of Various MPKCs by 2-Layer Nonlinear Piece in Hand Method
• Mapping for Iterative MMSE-SIC with Belief Propagation
• A Strength Evaluation of a Pseudorandom Number Generator MUGI against Linear Cryptanalysis(Symmetric Key Cryptography)(Cryptography and Information Security)
• Optimization for the Algebraic Method and Its Application to an Attack of MISTY1 (Symmetric Cipher) (Cryptography and Information Security)
• Scheduling Algorithm with Power Allocation for Random Unitary Beamforming
• MIMO Systems in the Presence of Feedback Delay
• Strength of Round function in RC6 Block Cipher against Higher Order Differential Attack
• The Algeblaic Degree and Security of Generalized PURE Ciphers
• Correction of Overlapping Template Matching Test Included in NIST Randomness Test Suite(Information Theory and Its Applications)
• A Study on Higher Order Differential Attack of Camellia(Special Section on Cryptography and Information Security)
• Effectiveness of Outline Measures of Strength against Differential and Linear Cryptanalysis (Special Section on Cryptography and Information Security)
• Special Section on Cryptography and Information Security
• A New Higher Order Differential of CLEFIA

もっと見る 閉じる

スポンサーリンク