Titlebook: Cryptology and Network Security; 11th International C Josef Pieprzyk,Ahmad-Reza Sadeghi,Mark Manulis Conference proceedings 2012 Springer-V

意外的成功

Applicability of OR-Proof Techniques to Hierarchical Identity-Based Identification

執(zhí)

散布

袋鼠

on A2U2 under the known-plaintext-attack model, which only needs at most 210 consecutive ciphertext bits and its corresponding plaintext with the time complexity about 2.. Our result is much better than that of the attack proposed by M. Abdelraheem et al. in [9] whose complexity is .(2.×.), where .

Opponent

摻假

ge recovery attacks on this cryptosystem. The first one is a broadcast attack: a single message of . bits can be recovered if it is encrypted for . recipients. The second attack is a multiple transmission attack in which a message can be recovered with a probability of (1???2.). if it is encrypted u

消滅

發(fā)酵劑

cks include the use of differential and linear relation patterns that allow to bypass the diffusion provided by MDS codes altogether. Therefore, we can attack only a single IDEA instance out of . copies, effectively using a narrow trail for the propagation of differences and masks across WIDEA-.. In

AGOG

and Japan. MULTI2 uses the Feistel structure and operates on the 64-bit blocks. The encryption key has 256 bits..This paper studies the linear analysis on MULTI2. We give a detailed bias analysis on MULTI2 round functions. For the first time formal proofs on their bias properties are given. This all

META