Category:LNCS 1008

From BibNetWiki

Lecture Notes in Computer Science, Volume 1008

Articles in category "LNCS 1008"

There are 29 articles in this category.

A A fast homophonic coding algorithm based on arithmetic coding A free energy minimization framework for inference problems in modulo 2 arithmetic A known plaintext attack on the PKZIP stream cipher Additive and linear structures of cryptographic functions B Binary cyclotomic generators C Clock-controlled pseudorandom generators on finite groups Construction of bent functions and balanced Boolean functions with high nonlinearity Correlation matrices Cryptanalysis of McGuffin

F Fast software encryption: second international workshop, Leuven, Belgium, December 14-16, 1994: proceedings Feedback with carry shift registers over finite fields H How to exploit the intractability of exact TSP for cryptography How to reverse engineer an EES device I Improved characteristics for differential cryptanalysis of hash functions based on block ciphers L Linear cryptanalysis of stream ciphers Linear cryptanalysis using multiple approximations and FEAL O On Fibonacci keystream generators On random mappings and random permutations On the need for multipermutations: Cryptanalysis of MD4 and SAFER

P Performance of block ciphers and hash functions - one year later Problems with the linear cryptanalysis of DES using more than one active S-box per round Properties of linear approximation tables S S-boxes and round functions with controllable linearity and differential uniformity SAFER K-64: One year later Searching for the optimum correlation attack T TEA, a tiny encryption algorithm The MacGuffin block cipher algorithm The RC5 encryption algorithm Truncated and higher order differentials