Near birthday attack on “$8$ bits” $\mathsf{AEAD}$ mode

2019 ◽  
Vol 10 (2) ◽  
pp. 47-60
Author(s):  
L R Akhmetzyanova ◽  
Grigorii Anatol'evich Karpunin ◽  
Grigory K Sedov
Keyword(s):  
Birthday Attack

Представлена атака на режим аутентифицированного шифрования ($\mathsf{AEAD}$-режим) «$8$ бит», который являлся одним из кандидатов на роль стандартизованного российского $\mathsf{AEAD}$-режима. Режим «8 бит» отличается от режима $\mathrm{CCM}$ несколькими конструктивными особенностями. Показано, что эти особенности позволяют построить атаку на режим «$8$ бит» с трудоемкостью, близкой к трудоемкости атаки на основе парадокса дней рождения. Предложены способы противодействия построенному методу.

scholarly journals A provably secure non-iterative hash function resisting birthday attack

2016 ◽  
Vol 654 ◽  
pp. 128-142 ◽  
Author(s):  
Shenghui Su ◽  
Tao Xie ◽  
Shuwang Lü
Keyword(s):  
Hash Function ◽  
Birthday Attack ◽  
Provably Secure

Weil sum for birthday attack in multivariate quadratic cryptosystem

2007 ◽  
Vol 1 (1) ◽  
Author(s):  
Tomohiro Harayama ◽  
Donald K. Friesen
Keyword(s):  
Birthday Attack

scholarly journals Security Analysis of Zipper Hash Against Multicollisions Attacks

2012 ◽  
Vol 2 (3) ◽  
pp. 226-231
Author(s):  
N. Bagheri
Keyword(s):  
Hash Function ◽  
Time Complexity ◽  
Security Analysis ◽  
Birthday Attack

In this paper,  the existence of multicollisions in Zipper Hash structure, a new Hash structure which was introduced to strengthen the iterated Hash structures, is presented. This study shows that finding multicollisions, i.e. 2k-way collision, in this Hash structure is not much harder than finding such  multicollisions in ordinary Merkle  - Damgard (MD)  structure. In fact, the complexity of the attacks is approximately n/2 times harder than what has been found for MD structures. Then, these large multicollisions are used as a tool to find D-way preimage for this structure. The complexity of finding 2K-way multicollisions and 2k-way preimages are  (eq) and (eq) respectively. Similar to what has been proved by Joux for MD, it is shown in this paper that this structure could not be used to create a Hash function with 2n-bit length by concatenating this structure with any other Hash structure by Hash’s output length of n-bite. It is also shown that time complexity of finding a collision for this concatenated structure is (eq)  which is much smaller than what was expected from generic-birthday attack which would be (eq) . In addition, it is shown that increasing the number of rounds of this Hash function can not improve its security against this attack significantly and the attacker can find multicollisions on this Hash function which means that this Hash function has a structural flaw.

scholarly journals A Generalized Birthday Attack

2007 ◽  
pp. 129-156 ◽  
Author(s):  
Marc Girault ◽  
Robert Cohen ◽  
2)Mireille Campana
Keyword(s):  
Birthday Attack
Sign in / Sign up

Export Citation Format

Share Document