Fast Software Encryption
From MaRDI portal
Publication:5473582
DOI10.1007/b137506zbMath1140.94334OpenAlexW4214882369WikidataQ28000487 ScholiaQ28000487MaRDI QIDQ5473582
Kishan Chand Gupta, Subhamoy Maitra, Deepak Kumar Dalai
Publication date: 22 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b137506
Related Items (31)
A construction of 1-resilient Boolean functions with good cryptographic properties ⋮ Basic theory in construction of Boolean functions with maximum possible annihilator immunity ⋮ Boolean functions of an odd number of variables with maximum algebraic immunity ⋮ A characterization of balanced Boolean functions with optimal algebraic immunity ⋮ Properties of a Family of Cryptographic Boolean Functions ⋮ Balanced \(2p\)-variable rotation symmetric Boolean functions with optimal algebraic immunity, good nonlinearity, and good algebraic degree ⋮ Cryptographic properties of the hidden weighted bit function ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ Upper bound for algebraic immunity on a subclass of Maiorana McFarland class of bent functions ⋮ Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity ⋮ On extended algebraic immunity ⋮ On the security of the Feng-Liao-Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks ⋮ A new method to construct Boolean functions with good cryptographic properties ⋮ Construction of Rotation Symmetric Boolean Functions on Odd Number of Variables with Maximum Algebraic Immunity ⋮ Concatenations of the hidden weighted bit function and their cryptographic properties ⋮ Algebraic immunity for cryptographically significant Boolean functions: analysis and construction ⋮ A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation ⋮ Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks ⋮ A systematic method of constructing Boolean functions with optimal algebraic immunity based on the generator matrix of the Reed-Muller code ⋮ A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions ⋮ Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks ⋮ Simpler proof for nonlinearity of majority function ⋮ An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity ⋮ Sequences, DFT and Resistance against Fast Algebraic Attacks ⋮ On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations ⋮ Hybrid classes of balanced Boolean functions with good cryptographic properties ⋮ A survey on nonlinear Boolean functions with optimal algebraic immunity suitable for stream ciphers ⋮ Some lower bounds on the algebraic immunity of functions given by their trace forms ⋮ Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions ⋮ Further properties of several classes of Boolean functions with optimum algebraic immunity ⋮ A class of rotation symmetric Boolean functions with optimum algebraic immunity
This page was built for publication: Fast Software Encryption
