Fast Software Encryption
From MaRDI portal
Publication:5713925
DOI10.1007/b98177zbMath1079.68550OpenAlexW2485295499MaRDI QIDQ5713925
No author found.
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
Related Items
Algebraic construction of near-bent function with application to cryptography, Basic theory in construction of Boolean functions with maximum possible annihilator immunity, Cryptanalysis of the Knapsack Generator, AFSRs synthesis with the extended Euclidean rational approximation algorithm, Algebraic construction of near-bent and APN functions, Mutually Clock-Controlled Feedback Shift Registers Provide Resistance to Algebraic Attacks, An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity, Designing against a class of algebraic attacks on symmetric block ciphers, Further properties of several classes of Boolean functions with optimum algebraic immunity