Fast Software Encryption
From MaRDI portal
Publication:5713903
DOI10.1007/b98177zbMath1079.68553OpenAlexW2485295499MaRDI QIDQ5713903
Publication date: 27 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98177
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Theory of software (68N99)
Related Items (3)
Minimum Distance between Bent and Resilient Boolean Functions ⋮ Modifying bent functions to obtain the balanced ones with high nonlinearity ⋮ A Maiorana--McFarland type construction for resilient Boolean functions on \(n\) variables (\(n\) even) with nonlinearity \(>2^{n-1}-2^{n/2}+2^{n/2-2}\)
This page was built for publication: Fast Software Encryption