Titlebook: Advances in Cryptology – EUROCRYPT ‘91; Workshop on the Theo Donald W. Davies Conference proceedings 1991 Springer-Verlag Berlin Heidelberg

大破壞

書目名稱Advances in Cryptology – EUROCRYPT ‘91影響因子(影響力)




書目名稱Advances in Cryptology – EUROCRYPT ‘91影響因子(影響力)學(xué)科排名




書目名稱Advances in Cryptology – EUROCRYPT ‘91網(wǎng)絡(luò)公開(kāi)度




書目名稱Advances in Cryptology – EUROCRYPT ‘91網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書目名稱Advances in Cryptology – EUROCRYPT ‘91被引頻次




書目名稱Advances in Cryptology – EUROCRYPT ‘91被引頻次學(xué)科排名




書目名稱Advances in Cryptology – EUROCRYPT ‘91年度引用




書目名稱Advances in Cryptology – EUROCRYPT ‘91年度引用學(xué)科排名




書目名稱Advances in Cryptology – EUROCRYPT ‘91讀者反饋




書目名稱Advances in Cryptology – EUROCRYPT ‘91讀者反饋學(xué)科排名

seruting

平常

Springer-Verlag Berlin Heidelberg 1991

transdermal

Boom Then Bust at the George HotelIn [.,.] we introduced the notion of differential cryptanalysis and described its application to DES [.] and several of its variants. In this paper we show the applicability of differential cryptanalysis to the Feal family of encryption algorithms and to the N-Hash hash function.

Ptsd429

Rutool Sharma,Ravi S. SannabhadtiThe Ziv-Lempel complexity is a well-known complexity measure. In our paper we consider the Ziv-Lempel complexity for periodic sequences as well as for pseudorandom number sequences. Further on, we will look at its cryptographic significance and compare it with other complexity measures such as the linear complexity.

弄臟

Parameter

Oscar Vorobjovas-Pinta,Violetta Wilknalysis is a chosen-plaintext attack on secret-key block ciphers that are based on iterating a cryptographically weak function r times (e.g., the 16-round Data Encryption Standard (DES)). It is shown that the success of such attacks on an r-round cipher depends on the existence of (r-1)-round differ

倒轉(zhuǎn)

Oscar Vorobjovas-Pinta,Violetta Wilkrithm can break this scheme with a number in the region of 2. computations. That number of operations is feasible in realistic time with modern computers. Thus the proposed hash function is not very secure. Among those computations a substantial number can be performed once for all. A faster result

甜得發(fā)膩

Ccu106

Oscar Vorobjovas-Pinta,Violetta Wilkation algorithm for decoding an arbitrary linear code. The algorithm provides guaranteed correction of all error patterns with Hamming weight less than d/2, where d is the minimum distance of the code, and has time complexity about O(n.) where n is the block length. The approach is illustrated by th