scholarly journals Measuring the Sum-of-Squares Indicator of Boolean Functions in Encryption Algorithm for Internet of Things

2019 ◽  
Vol 2019 ◽  
pp. 1-15
Author(s):  
Yu Zhou ◽  
Yongzhuang Wei ◽  
Fengrong Zhang

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.

2014 ◽  
Vol 25 (03) ◽  
pp. 343-353 ◽  
Author(s):  
YU ZHOU ◽  
LIN WANG ◽  
WEIQIONG WANG ◽  
XINFENG DONG ◽  
XIAONI DU

The Global Avalanche Characteristics (including the sum-of-squares indicator and the absolute indicator) measure the overall avalanche characteristics of a cryptographic Boolean function. Son et al. (1998) gave the lower bound on the sum-of-squares indicator for a balanced Boolean function. In this paper, we give a sufficient and necessary condition on a balanced Boolean function reaching the lower bound on the sum-of-squares indicator. We also analyze whether these balanced Boolean functions exist, and if they reach the lower bounds on the sum-of-squares indicator or not. Our result implies that there does not exist a balanced Boolean function with n-variable for odd n(n ≥ 5). We conclude that there does not exist a m(m ≥ 1)-resilient function reaching the lower bound on the sum-of-squares indicator with n-variable for n ≥ 7.


2021 ◽  
Vol 16 (1) ◽  
pp. 1-13
Author(s):  
Yu Zhou ◽  
Jianyong Hu ◽  
Xudong Miao ◽  
Yu Han ◽  
Fuzhong Zhang

Abstract The notion of the confusion coefficient is a property that attempts to characterize confusion property of cryptographic algorithms against differential power analysis. In this article, we establish a relationship between the confusion coefficient and the autocorrelation function for any Boolean function and give a tight upper bound and a tight lower bound on the confusion coefficient for any (balanced) Boolean function. We also deduce some deep relationships between the sum-of-squares of the confusion coefficient and other cryptographic indicators (the sum-of-squares indicator, hamming weight, algebraic immunity and correlation immunity), respectively. Moreover, we obtain some trade-offs among the sum-of-squares of the confusion coefficient, the signal-to-noise ratio and the redefined transparency order for a Boolean function.


2018 ◽  
Vol 7 (6) ◽  
pp. 31-37 ◽  
Author(s):  
Muhammad Asif Habib ◽  
Mudassar Ahmad ◽  
Sohail Jabbar ◽  
Syed Hassan Ahmed ◽  
Joel J.P.C. Rodrigues

2021 ◽  
Vol 5 (3) ◽  
pp. 483-488
Author(s):  
Cinantya Paramita ◽  
Usman Sudibyo

Mp3 is one form of audio file extension that is widely used today. With a variety of uses in a variety of mp3 systems become one of the audio extensions that are commonly found in technology systems of the Internet of Things era. However, with the many uses of the .mp3 file extension, there is a new problem, namely the security of the data itself. From these problems, the author aims to examine the security of the mp3 file by designing cryptographic science-based applications. The cryptographic algorithm used in the application is a combination of the asymmetric RSA 2048 algorithm and symmetric columnic transpositions. RSA 2048 algorithm was chosen because it has a key length in accordance with NIST standards in securing data. By combining the two algorithms, the application system will have the ability to manage mp3 files and encrypt mp3 files with the results of data that cannot be played like mp3 files in general. This application system will be developed by prototype method which is the best method in developing a system with trial and error in algorithm development.  


Author(s):  
Bo Hong-guang ◽  
Li Huan-zhi ◽  
Zhang Hui-lin ◽  
Guo Yi ◽  
Mu Wei

Disruptions happen in the actual manufacturing system under environment of the Internet of Things and they make the system difficult to manage. However, the convenient access to information of orders, equipment and participants make disruption recovery easier. In this paper we build a disruption recovery scheduling integer programming model considering the objective of minimizing total weighted completion-time (as the original objective) and the objectives of maximizing total consumer satisfaction degree & minimizing total deviation degree (as the revising objective). A PVPS (PSO & VNS Parallel Search) algorithm is proposed. The experiments results prove all above are effective.


2021 ◽  
Vol 5 (2) ◽  
pp. 252-260
Author(s):  
Ariyan Zubaidi ◽  
◽  
Rhomy Idris Sardi ◽  
Andy Hidayat Jatmika ◽  
◽  
...  

Data confidentiality and resource's limitation issues are challenges for the Internet of Things. To implement good security on IoT systems, cryptography can do it, but it needs an effective encryption algorithm that does not require a lot of resources. The purpose of this study is to secure an IoT system by implementing an algorithm that is successful in maintaining the confidentiality of data transmitted. This research uses an experimental approach, by creating an IoT system for agriculture and adding an encryption algorithm. The IoT system uses NodeMCU as a microcontroller. NodeMCU is a microcontroller with small resources so it needs an efficient algorithm to be implemented in it. One algorithm that has good performance in a desktop computing environment is the Advance Encryption Standard (AES) algorithm. The algorithm is tested in an IoT computing environment with a data exchange architecture using an REST (Representational State Transfer) web service, resulting in an IoT system for agriculture with cryptographic implementations in it. In the tests carried out, the encryption process of 128 and 256 bits of plain text took 266.31 and 274.31 microseconds, while the memory used was 16% and 17% of the total memory, respectively. This shows the encryption time is fast, and the memory usage is relatively small.


2020 ◽  
Vol 2020 ◽  
pp. 1-21
Author(s):  
Azeema Yaseen ◽  
Mohsin Nazir ◽  
Aneeqa Sabah ◽  
Shahzadi Tayyaba ◽  
Zuhaib Ashfaq Khan ◽  
...  

The internet of things is used as a demonstrative keyword for evolution of the internet and physical realms, by means of pervasive distributed commodities with embedded identification, sensing, and actuation abilities. Imminent intellectual technologies are subsidizing internet of things for information transmission within physical and autonomous digital entities to provide amended services, leading towards a new communication era. Substantial amounts of heterogeneous hardware devices, e.g., radio frequency identification (RFID) tags, sensors, and various network protocols are exploited to support object identification and network communication. Data generated by these digital objects is termed as “Big Data” and incorporates high dimensional space with noisy, irrelevant, and redundant features. Direct execution of mining techniques onto such kind of high dimensionality attribute space can increase cost and complexity. Data analytic mechanisms are embedded into internet of things to permit intelligent decision-making capabilities. These notions have raised new challenges regarding internet of things from a data and algorithm perspective. The proposed study identifies the problem in the internet of things network and proposes a novel cuckoo search-based outdoor data management. The technique of the feature extraction is used for the extraction of expedient information from raw and high-dimensional data. After the implementation for the cuckoo search-based feature extraction, few test benchmarks are introduced to evaluate the performance of mutated cuckoo search algorithms. The consequential low-dimensional data optimizes classification accuracy along with reduced complexity and cost.


2015 ◽  
Vol 2015 ◽  
pp. 1-8 ◽  
Author(s):  
Zepeng Zhuo ◽  
Jinfeng Chong

The Boolean function which has equal absolute spectral values under the nega-Hadamard transform is called negabent function. In this paper, the special Boolean functions by concatenation are presented. We investigate their nega-Hadamard transforms, nega-autocorrelation coefficients, sum-of-squares indicators, and so on. We establish a new equivalent statement onf1∥f2which is negabent function. Based on them, the construction for generating the negabent functions by concatenation is given. Finally, the function expressed asf(Ax⊕a)⊕b·x⊕cis discussed. The nega-Hadamard transform and nega-autocorrelation coefficient of this function are derived. By applying these results, some properties are obtained.


Sign in / Sign up

Export Citation Format

Share Document