Measuring the Sum-of-Squares Indicator of Boolean Functions in Encryption Algorithm for Internet of Things
Autor: | Yu Zhou, Fengrong Zhang, Yongzhuang Wei |
---|---|
Rok vydání: | 2019 |
Předmět: |
Theoretical computer science
Article Subject Computer Networks and Communications Computer science Balanced boolean function Cryptography 0102 computer and information sciences 02 engineering and technology Computer Science::Computational Complexity Encryption 01 natural sciences Upper and lower bounds Search algorithm lcsh:Technology (General) 0202 electrical engineering electronic engineering information engineering lcsh:Science (General) Boolean function Computer Science::Cryptography and Security business.industry Explained sum of squares 020206 networking & telecommunications Symmetric-key algorithm 010201 computation theory & mathematics lcsh:T1-995 business lcsh:Q1-390 Information Systems |
Zdroj: | Security and Communication Networks, Vol 2019 (2019) |
ISSN: | 1939-0122 1939-0114 |
DOI: | 10.1155/2019/1348639 |
Popis: | Encryption algorithm has an important application in ensuring the security of the Internet of Things. Boolean function is the basic component of symmetric encryption algorithm, and its many cryptographic properties are important indicators to measure the security of cryptographic algorithm. This paper focuses on the sum-of-squares indicator of Boolean function; an upper bound and a lower bound of the sum-of-squares on Boolean functions are obtained by the decomposition Boolean functions; some properties and a search algorithm of Boolean functions with the same autocorrelation (or cross-correlation) distribution are given. Finally, a construction method to obtain a balanced Boolean function with small sum-of-squares indicator is derived by decomposition Boolean functions. Compared with the known balanced Boolean functions, the constructed functions have the higher nonlinearity and the better global avalanche characteristics property. |
Databáze: | OpenAIRE |
Externí odkaz: |