The main efficiency indicators of cryptographic Boolean functions and vector mappings, which are used as nodes of the complexity in symmetric cryptographic transformations, are substantiated. Methods of heuristic generation of cryptographic Boolean functions and nonlinear S-boxes for symmetric ciphers that meet the established security requirements are investigated. Prospects for further research with the aim of improving heuristic methods for the synthesis of random S-boxes are substantiated.
Random S-boxes generation methods for symmetric cryptography
Kuznetsov
;
2019-01-01
Abstract
The main efficiency indicators of cryptographic Boolean functions and vector mappings, which are used as nodes of the complexity in symmetric cryptographic transformations, are substantiated. Methods of heuristic generation of cryptographic Boolean functions and nonlinear S-boxes for symmetric ciphers that meet the established security requirements are investigated. Prospects for further research with the aim of improving heuristic methods for the synthesis of random S-boxes are substantiated.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
