论文部分内容阅读
NUSH is a block cipher as a candidate for NESSIE. NUSH is analyzed by linear crypt-analysis . The complexity δ = (ε , η) of the attack consists of data complexity ε and time complexity η. Three linear approximations are used to analyze NUSH with 64-bit block. When |K| = 128 bits, the complexities of three attacks are (258, 2124), (260, 278) and (262, 255) respectively. When |K| = 192 bits, the complexities of three attacks are (258, 2157) (260, 2%) and (262, 258) respectively. When |K| = 256 bits, the complexities of three attacks are (258, 2125), (260, 278) and (262, 253) respectively. Three linear approximations are used to analyze NUSH with 128-bit block. When |K|= 128 bits, the complexities of three attacks are (2122, 295), (2124, 257) and (2126, 252) respectively. When |K| = 192 bits, the complexities of three attacks are (2122, 2142), (2124, 275) and (2126, 258) respectively. When |K|= 256 bits, the complexities of three attacks are (2122, 2168), (2124, 281) and (2126, 264) respectively. Two l
NUSH is a block cipher as a candidate for NESSIE. NUSH is analyzed by linear crypt-analysis. The complexity δ = (ε, η) of the attack consists of data complexity ε and time complexity η. Three linear approximations are used to analyze NUSH with | K | = 128 bits, the complexities of three attacks are (258, 2124), (260,278) and (262,255) respectively. When | K | = 192 bits, the complexities of When | K | = 256 bits, the complexities of three attacks are (258, 2125), (260, 278) and (262) When | K | = 128 bits, the complexities of three attacks are (2122, 295), (2124, 257) and (2126, 252) respectively. Two linear equations are used to analyze NUSH with 128- when | K | = 192 bits, the complexities of three attacks are (2122, 2142), (2124, 275) and (2126, 258) respectively respectively. 2122, 2168), (2124, 281) and (2126, 264) respectively. Two l