scientific article; zbMATH DE number 1543297
From MaRDI portal
Publication:4520764
zbMATH Open0967.68059MaRDI QIDQ4520764FDOQ4520764
Authors: Daniel Olejár, Martin Stanek 
Publication date: 27 February 2001
Full work available at URL: http://www.jucs.org/jucs_4_8/on_cryptographic_properties_of
Title of this publication is not available (Why is that?)
Recommendations
Cited In (33)
- Asymptotic estimates for numbers of Boolean mappings with given cryptographic properties
- Computer Aided Systems Theory – EUROCAST 2005
- Asymptotic behavior of perturbations of symmetric functions
- Title not available (Why is that?)
- Cryptographic properties of monotone Boolean functions
- Quasi-random Boolean functions
- Boolean functions: degree and support
- Thickness distribution of Boolean functions in 4 and 5 variables and a comparison with other cryptographic properties
- Generating cryptographically strong Boolean functions using partial information
- Progress in Cryptology - INDOCRYPT 2004
- Asymptotic nonlinearity of vectorial Boolean functions
- Hybrid classes of balanced Boolean functions with good cryptographic properties
- Title not available (Why is that?)
- Nonlinearity measures of random Boolean functions
- A sufficient and necessary condition of judging the independence of Boolean functions system
- Enumerating Boolean functions of cryptographic significance
- On Boolean functions with generalized cryptographic properties
- Boolean functions with five controllable cryptographic properties
- From cryptanalysis to cryptographic property of a Boolean function
- Title not available (Why is that?)
- On the construction of new bent functions from the max-weight and min-weight functions of old bent functions
- Dirichlet product for Boolean functions
- Boolean functions and their applications in cryptography
- Title not available (Why is that?)
- Enhanced Boolean functions suitable for the filter model of pseudo-random generator
- Title not available (Why is that?)
- Automata, Languages and Programming
- Information leakage of a randomly selected boolean function
- Symmetric random function generator (SRFG): a novel cryptographic primitive for designing fast and robust algorithms
- Almost Security of Cryptographic Boolean Functions
- Title not available (Why is that?)
- On the multi-output filtering model and its applications
- On the independence of Boolean functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4520764)
