Generalized Classes of Weak Keys on RC4 Using Predictive State | Zendy

Teramura Ryoichi | Zendy; Toshihiro Ohigashi | Zendy; Hidenori Kuwakado | Zendy; Masakatu Morii | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Generalized Classes of Weak Keys on RC4 Using Predictive State

Author(s) -

Teramura Ryoichi,

Toshihiro Ohigashi,

Hidenori Kuwakado,

Masakatu Morii

Publication year - 2011

Publication title -

ieice transactions on fundamentals of electronics communications and computer sciences

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.188

H-Index - 52

eISSN - 1745-1337

pISSN - 0916-8508

DOI - 10.1587/transfun.e94.a.10

Subject(s) - stream cipher , byte , rc4 , key (lock) , class (philosophy) , theoretical computer science , state (computer science) , mathematics , computer science , discrete mathematics , cryptography , algorithm , computer security , programming language , artificial intelligence

Conventional class of weak keys on RC4 stream cipher is defined as a specific case that combinations of the first three bytes of secret key satisfy two relational equations. This paper expands and generalizes the classes of weak keys using generalized relational equations and special classes of the internal state (called predictive state). We derive the probability that generalized classes of weak keys leak the information of bytes of the secret key. Furthermore, we enumerate the generalized classes of weak keys and show that most of them leak more information of the secret key than Roos' one.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research