A survey of metaheuristic algorithms for the design of cryptographic Boolean functions
From MaRDI portal
Publication:6088860
DOI10.1007/s12095-023-00662-2arXiv2301.08012OpenAlexW4385381462MaRDI QIDQ6088860
Domagoj Jakobovic, Marko Đurasević, Luca Mariot, Stjepan Picek
Publication date: 14 December 2023
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2301.08012
Approximation methods and heuristics in mathematical programming (90C59) Cryptography (94A60) Boolean functions (94D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Exploring semi-bent Boolean functions arising from cellular automata
- 9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class
- On ``bent functions
- Construction and search of balanced Boolean functions on even number of variables towards excellent autocorrelation profile
- Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts
- On Codes With Low Peak-to-Average Power Ratio for Multicode CDMA
- On the existence of (9,3,5,240) resilient functions
- Search for Boolean Functions With Excellent Profiles in the Rotation Symmetric Class
- Bent-function sequences
- Combinatorial Designs
- A characterization of bent functions in terms of strongly regular graphs
- Generalized Lexicographic MultiObjective Combinatorial Optimization. Application to Cryptography
- A Wide Class of Boolean Functions Generalizing the Hidden Weight Bit Function
- Boolean Functions for Cryptography and Coding Theory
- Bent Functions
- Fast Software Encryption
- Introduction to evolutionary computing
- Handbook of metaheuristics
- The design of (almost) disjunct matrices by evolutionary algorithms
