Five-valued Boolean functions play an important role in the design of symmetric cryptography.While the design and properties of single-output almost optimal five-valued spectra Boolean functions have been extensively ...Five-valued Boolean functions play an important role in the design of symmetric cryptography.While the design and properties of single-output almost optimal five-valued spectra Boolean functions have been extensively studied over the past few decades,there has been limited research on the construction of almost optimal five-valued spectra vectorial Boolean functions.In this paper,we present a construction method for even-variable 2-output almost optimal five-valued spectra balanced Boolean functions,whose Walsh spectra values belong to the set{0,±2^(n/2),±2^(n/2+1)},at the same time,we discuss the existence of sufficient conditions in the construction.Additionally,this paper presents a novel construction method for balanced single-output Boolean functions with even variables featuring a special five-valued spectral structure,whose Walsh spectra values are constrained to the set{0,±2^(n/2),±3·2^(n/2)}.These functions provide new canonical examples for the study of Boolean function spectral theory.展开更多
For an odd integer n ≥ 7, this paper presented a class of n-variable rotation symmetric Boolean functions （RSBFs） with optimum algebraic immunity. The nonlinearity of the constructed functions is determined.
The Boolean functions in an affine equivalence class are of the same algebraicdegree and nonlinearity, but may satisfy different order of correlation immunity and propa-gation criterion. A method is presented in this ...The Boolean functions in an affine equivalence class are of the same algebraicdegree and nonlinearity, but may satisfy different order of correlation immunity and propa-gation criterion. A method is presented in this paper to find Boolean functions with higherorder correlation immunity or satisfying higher order propagation criterion in an affine equiv-alence class. 8 AES s-box functions are not better Boolean functions in their affine equiva-lence class.展开更多
This paper proposes a practical algorithm for systematically generating strong Boolean functions (f:GF(2) n →GF(2)) with cryptographic meaning. This algorithm takes bent function as input and directly outputs the res...This paper proposes a practical algorithm for systematically generating strong Boolean functions (f:GF(2) n →GF(2)) with cryptographic meaning. This algorithm takes bent function as input and directly outputs the resulted Boolean function in terms of truth table sequence. This algorithm was used to develop two classes of balanced Boolean functions, one of which has very good cryptographic properties:nl(f)=2 2k?1?2k+2k?2 (n=2k), with the sum-of-squares avalanche characteristic off satisfying σf=24k+23k+2+23k-2 and the absolute avalanche characteristic off satisfying σf=24k+23k+2+23k-2. This is the best result up to now compared to existing ones. Instead of bent sequences, starting from random Boolean functions was also tested in the algorithm. Experimental results showed that starting from bent sequences is highly superior to starting from random Boolean functions. Key words Boolean functions - Bent sequences - Nonlinearity - GAC - PC - Balancedness Document code A CLC number TP301.6展开更多
Algebraic immunity is a new cryptographic criterion proposed against algebraic attacks. In order to resist algebraic attacks, Boolean functions used in many stream ciphers should possess high algebraic immunity. This ...Algebraic immunity is a new cryptographic criterion proposed against algebraic attacks. In order to resist algebraic attacks, Boolean functions used in many stream ciphers should possess high algebraic immunity. This paper presents one main result to find balanced rotation symmetric Boolean functions with maximum algebraic immunity. Through swapping the values of two orbits of rotation class of the majority function, a class of 4k＋l variable Boolean functions with maximum algebraic immu- nity is constructed. The function f（x） we construct always has terms of degree n-2 independence of what ever n is. And the nonlinearity off（x） is relatively good for large n.展开更多
To protect against algebraic attacks, a high algebraic immunity is now an important criterion for Boolean functions used in stream ciphers. In this paper, a new method based on a univariate polynomial representation o...To protect against algebraic attacks, a high algebraic immunity is now an important criterion for Boolean functions used in stream ciphers. In this paper, a new method based on a univariate polynomial representation of Boolean functions is proposed. The proposed method is used to constmct Boolean functions with an odd number of variables and with maximum algebraic immunity. We also discuss the nonlinearity of the constructed functions. Moreover, a lower bound is deter- mined for the number of Boolean functions with rmximum algebraic immunity.展开更多
We use evolutionaly computing to synthesize Boolean functions randomly Byusing specific crossover and mutation operator,in evolving process and modifying search space andfitness function,we get some high non-linearity...We use evolutionaly computing to synthesize Boolean functions randomly Byusing specific crossover and mutation operator,in evolving process and modifying search space andfitness function,we get some high non-linearity functions which have other good cryptographycharacteristics such as autocorrelation etc Comparing to other heuristic search techniques,evolutionary computing approach is more effective because of global search strategy and implicitparallelism.展开更多
The Walsh transform is an important tool to investigate cryptographic properties of Boolean functions.This paper is devoted to study the Walsh transform of a class of Boolean functions defined as g(x)=f(x)Tr^(n)_(1)(x...The Walsh transform is an important tool to investigate cryptographic properties of Boolean functions.This paper is devoted to study the Walsh transform of a class of Boolean functions defined as g(x)=f(x)Tr^(n)_(1)(x)+h(x)Tr^(n)_(1)(δx),by making use of the known conclusions of Walsh transform and the properties of trace function,and the conclusion is obtained by generalizing an existing result.展开更多
Boolean or switching functions can be associated to finite aligned spaces in a way similar to the way they can be associated to finite topological spaces. We prove a characterization of switching functions associated ...Boolean or switching functions can be associated to finite aligned spaces in a way similar to the way they can be associated to finite topological spaces. We prove a characterization of switching functions associated to aligned spaces which is similar to the one we have given for switching functions associated to finite topological spaces.展开更多
In this paper, we survey a number of studies in the literature on improving lightweight systems in the Internet of Things (IoT). The paper illustrates recent development of Boolean cryptographic function Application a...In this paper, we survey a number of studies in the literature on improving lightweight systems in the Internet of Things (IoT). The paper illustrates recent development of Boolean cryptographic function Application and how it assists in using hardware such as the internet of things. For a long time there seems to be little progress in applying pure mathematics in providing security since the wide progress made by George Boole and Shannon. We discuss cryptanalysis of Boolean functions to avoid trapdoors and vulnerabilities in the development of block ciphers. It appears that there is significant progress. A comparative analysis of lightweight cryptographic schemes is reported in terms of execution time, code size and throughput. Depending on the schemes and the structure of the algorithms, these parameters change but remain within reasonable values making them suited for Internet of things applications. The driving force of lightweight cryptography (LWC) stems mainly from its direct applications in the real world since it provides solutions to actual problems faced by designers of IoT systems. Broadly speaking, lightweight cryptographic algorithms are designed to achieve two main goals. The first goal of a cryptographic algorithm is to withstand all known cryptanalytic attacks and thus to be secure in the black-box model. The second goal is to build the cryptographic primitive in such a way that its implementations satisfy a clearly specified set of constraints that depend on a case-by-case basis.展开更多
This paper discusses the degree of completeness of cryptographic functions, which is one of the cryptographic criteria should be considered in the design of stream ciphers. We establish the relationships between the d...This paper discusses the degree of completeness of cryptographic functions, which is one of the cryptographic criteria should be considered in the design of stream ciphers. We establish the relationships between the degree of completeness and other cryptographic criteria. For resilient Boolean functions, a method to enhance the degree of completeness is proposed, while the nonlinearity and the algebraic degree do not decrease. Moreover, two constructions of resilient functions are provided, which have optimal degree of completeness, high nonlinearity, and high algebraic degree.展开更多
The structure of a canalizing function is discussed. Using a new matrix product, namely semitensor product, the logical function is expressed in its matrix form. From its matrix expression, a criterion is obtained to ...The structure of a canalizing function is discussed. Using a new matrix product, namely semitensor product, the logical function is expressed in its matrix form. From its matrix expression, a criterion is obtained to test whether a logical function is a canalizing function. Then a formula is obtained to calculate the number of canalizing functions. Moreover, an algorithm is presented to generate canalizing functions. Finally, some results obtained are extended to seminested canalizing functions.展开更多
Based on the relationship between cheating immune secret sharing and cryptographic criteria of Boolean functions, to design a cheating immune secret sharing scheme, a 1-resilient function satisfying the strict avalanc...Based on the relationship between cheating immune secret sharing and cryptographic criteria of Boolean functions, to design a cheating immune secret sharing scheme, a 1-resilient function satisfying the strict avalanche criterion （SAC） is needed. In this paper, a technique on constructing a cheating immune secret sharing function is studied. By using Maiorana-McFarland construction technique, two new methods to construct cheating immune secret sharing functions are proposed.展开更多
This study reveals the successful design of the data acquisition system for pH sensors.The data acquisition system includes an instrumentation amplifier,a low pass filter and a calculation program.The instrumentation ...This study reveals the successful design of the data acquisition system for pH sensors.The data acquisition system includes an instrumentation amplifier,a low pass filter and a calculation program.The instrumentation amplifier used as the readout circuit has many advantages,including high input impedance,high gain,low output impedance,high CMRR and high bandwidth.The low pass filter is employed to cancel the circuit noise.The calculation program uses the two-point calibration method to calculate the sample concentration.Furthermore,this study employs Boolean function to cancel error signals.As indicated by experimental results,the readout circuit obtains the sensing signal and the calculation program calculates the pH value.Hence,this study successfully fabricates an effective data acquisition system for pH sensors.展开更多
Based on the properties of trace functions and quadratic forms, this paper presents value distributions of Walsh spectrum of the Plateaued functions of the form Tr（R（x）） with n=3r or 4r variables, where r 〉 1 is ...Based on the properties of trace functions and quadratic forms, this paper presents value distributions of Walsh spectrum of the Plateaued functions of the form Tr（R（x）） with n=3r or 4r variables, where r 〉 1 is an odd integer. Our results can be used to determine the numbers of non-zero Walsh spectrum values and the nonlinearities of these functions, and estimate their resiliency orders. Especially, the value distributions can be used to deduce the tight lower bounds of the second order nonlinearity of two classes of Boolean functions. It is demonstrated that our bounds are better than the previously obtained bounds.展开更多
A class of semi-bent functions with an even number of variables is constructed by using the values of Kloosterman sums.These semi-bent functions are Boolean functions with four trace terms.Moreover,it is shown that th...A class of semi-bent functions with an even number of variables is constructed by using the values of Kloosterman sums.These semi-bent functions are Boolean functions with four trace terms.Moreover,it is shown that the algebraic degrees of the new semi-bent functions attain the maximum values.展开更多
Recently there has been great interest in the idea that evolvable system based on the principle of artifcial intelligence can be used to continuously and autonomously adapt the behaviour of physically embedded systems...Recently there has been great interest in the idea that evolvable system based on the principle of artifcial intelligence can be used to continuously and autonomously adapt the behaviour of physically embedded systems such as autonomous mobile robots and intelligent home devices. Meanwhile, we have seen the introduction of evolvable hardware(EHW): new integrated electronic circuits that are able to continuously evolve to adapt the chages in the environment implemented by evolutionary algorithms such as genetic algorithm(GA) and reinforcement learning. This paper concentrates on developing a robotic navigation system whose basic behaviours are obstacle avoidance and light source navigation. The results demonstrate that the intrinsic evolvable hardware system is able to create the stable robotiiuc behaviours as required in the real world instead of the traditional hardware systems.展开更多
After Google reported its realization of quantum supremacy,Solving the classical problems with quantum computing is becoming a valuable research topic.Switching function minimization is an important problem in Electro...After Google reported its realization of quantum supremacy,Solving the classical problems with quantum computing is becoming a valuable research topic.Switching function minimization is an important problem in Electronic Design Automation(EDA)and logic synthesis,most of the solutions are based on heuristic algorithms with a classical computer,it is a good practice to solve this problem with a quantum processer.In this paper,we introduce a new hybrid classic quantum algorithm using Grover’s algorithm and symmetric functions to minimize small Disjoint Sum of Product(DSOP)and Sum of Product(SOP)for Boolean switching functions.Our method is based on graph partitions for arbitrary graphs to regular graphs,which can be solved by a Grover-based quantum searching algorithm we proposed.The Oracle for this quantum algorithm is built from Boolean symmetric functions and implemented with Lattice diagrams.It is shown analytically and verified by simulations on a quantum simulator that our methods can find all solutions to these problems.展开更多
The main results in this paper are to construct two classes of plateaued functions with desirable cryptographic properties. By using the Maiorana-McFarland construction, a class of highly nonlinear resilient plateaued...The main results in this paper are to construct two classes of plateaued functions with desirable cryptographic properties. By using the Maiorana-McFarland construction, a class of highly nonlinear resilient plateaued functions satisfying the propagation criterion has been obtained. Johansson,s et al＇ s construction is modified slightly to obtain highly nonlinear multi-output resilient plateaued functions.展开更多
基金National Natural Science Foundation of China(62272360)。
文摘Five-valued Boolean functions play an important role in the design of symmetric cryptography.While the design and properties of single-output almost optimal five-valued spectra Boolean functions have been extensively studied over the past few decades,there has been limited research on the construction of almost optimal five-valued spectra vectorial Boolean functions.In this paper,we present a construction method for even-variable 2-output almost optimal five-valued spectra balanced Boolean functions,whose Walsh spectra values belong to the set{0,±2^(n/2),±2^(n/2+1)},at the same time,we discuss the existence of sufficient conditions in the construction.Additionally,this paper presents a novel construction method for balanced single-output Boolean functions with even variables featuring a special five-valued spectral structure,whose Walsh spectra values are constrained to the set{0,±2^(n/2),±3·2^(n/2)}.These functions provide new canonical examples for the study of Boolean function spectral theory.
基金Supported by the National Natural Science Foundation of China ( 60603012)the Foundation of Hubei Provincial Department of Education, China (D200610004)
文摘For an odd integer n ≥ 7, this paper presented a class of n-variable rotation symmetric Boolean functions （RSBFs） with optimum algebraic immunity. The nonlinearity of the constructed functions is determined.
文摘The Boolean functions in an affine equivalence class are of the same algebraicdegree and nonlinearity, but may satisfy different order of correlation immunity and propa-gation criterion. A method is presented in this paper to find Boolean functions with higherorder correlation immunity or satisfying higher order propagation criterion in an affine equiv-alence class. 8 AES s-box functions are not better Boolean functions in their affine equiva-lence class.
文摘This paper proposes a practical algorithm for systematically generating strong Boolean functions (f:GF(2) n →GF(2)) with cryptographic meaning. This algorithm takes bent function as input and directly outputs the resulted Boolean function in terms of truth table sequence. This algorithm was used to develop two classes of balanced Boolean functions, one of which has very good cryptographic properties:nl(f)=2 2k?1?2k+2k?2 (n=2k), with the sum-of-squares avalanche characteristic off satisfying σf=24k+23k+2+23k-2 and the absolute avalanche characteristic off satisfying σf=24k+23k+2+23k-2. This is the best result up to now compared to existing ones. Instead of bent sequences, starting from random Boolean functions was also tested in the algorithm. Experimental results showed that starting from bent sequences is highly superior to starting from random Boolean functions. Key words Boolean functions - Bent sequences - Nonlinearity - GAC - PC - Balancedness Document code A CLC number TP301.6
基金Supported by the National Natural Science Foundation of China(61272434)the Natural Science Foundation of Shandong Province(ZR 2012FM004,ZR2013FQ021)the Foundation of Science and Technology on Information Assume Laboratory(KJ-13-004)
文摘Algebraic immunity is a new cryptographic criterion proposed against algebraic attacks. In order to resist algebraic attacks, Boolean functions used in many stream ciphers should possess high algebraic immunity. This paper presents one main result to find balanced rotation symmetric Boolean functions with maximum algebraic immunity. Through swapping the values of two orbits of rotation class of the majority function, a class of 4k＋l variable Boolean functions with maximum algebraic immu- nity is constructed. The function f（x） we construct always has terms of degree n-2 independence of what ever n is. And the nonlinearity off（x） is relatively good for large n.
基金This work was supported by the National Natural Science Foundation of China under Grants No. 61103191, No. 61070215 the Funds of Key Lab of Fujian Province University Network Security and Cryptology under Crant No. 2011003 and the Open Research Fund of State Key Laboratory of Inforrmtion Security.
文摘To protect against algebraic attacks, a high algebraic immunity is now an important criterion for Boolean functions used in stream ciphers. In this paper, a new method based on a univariate polynomial representation of Boolean functions is proposed. The proposed method is used to constmct Boolean functions with an odd number of variables and with maximum algebraic immunity. We also discuss the nonlinearity of the constructed functions. Moreover, a lower bound is deter- mined for the number of Boolean functions with rmximum algebraic immunity.
基金Supported by the National Natural Science Foun-dation of China(69973034,60373087,60473023)the Ph.D Pro-grams Foundation of Ministry of Education of China(20020486046)
文摘We use evolutionaly computing to synthesize Boolean functions randomly Byusing specific crossover and mutation operator,in evolving process and modifying search space andfitness function,we get some high non-linearity functions which have other good cryptographycharacteristics such as autocorrelation etc Comparing to other heuristic search techniques,evolutionary computing approach is more effective because of global search strategy and implicitparallelism.
基金Supported by the Natural Science Foundation of Anhui Higher Education Institutions of China(KJ2020ZD008)Key Research and Development Projects in Anhui Province(202004a05020043)the Graduate Innovation Fund of Huaibei Normal University(yx2021022)。
文摘The Walsh transform is an important tool to investigate cryptographic properties of Boolean functions.This paper is devoted to study the Walsh transform of a class of Boolean functions defined as g(x)=f(x)Tr^(n)_(1)(x)+h(x)Tr^(n)_(1)(δx),by making use of the known conclusions of Walsh transform and the properties of trace function,and the conclusion is obtained by generalizing an existing result.
文摘Boolean or switching functions can be associated to finite aligned spaces in a way similar to the way they can be associated to finite topological spaces. We prove a characterization of switching functions associated to aligned spaces which is similar to the one we have given for switching functions associated to finite topological spaces.
文摘In this paper, we survey a number of studies in the literature on improving lightweight systems in the Internet of Things (IoT). The paper illustrates recent development of Boolean cryptographic function Application and how it assists in using hardware such as the internet of things. For a long time there seems to be little progress in applying pure mathematics in providing security since the wide progress made by George Boole and Shannon. We discuss cryptanalysis of Boolean functions to avoid trapdoors and vulnerabilities in the development of block ciphers. It appears that there is significant progress. A comparative analysis of lightweight cryptographic schemes is reported in terms of execution time, code size and throughput. Depending on the schemes and the structure of the algorithms, these parameters change but remain within reasonable values making them suited for Internet of things applications. The driving force of lightweight cryptography (LWC) stems mainly from its direct applications in the real world since it provides solutions to actual problems faced by designers of IoT systems. Broadly speaking, lightweight cryptographic algorithms are designed to achieve two main goals. The first goal of a cryptographic algorithm is to withstand all known cryptanalytic attacks and thus to be secure in the black-box model. The second goal is to build the cryptographic primitive in such a way that its implementations satisfy a clearly specified set of constraints that depend on a case-by-case basis.
基金Supported by the National Key Basic Research Program of China(No.2013CB834204)
文摘This paper discusses the degree of completeness of cryptographic functions, which is one of the cryptographic criteria should be considered in the design of stream ciphers. We establish the relationships between the degree of completeness and other cryptographic criteria. For resilient Boolean functions, a method to enhance the degree of completeness is proposed, while the nonlinearity and the algebraic degree do not decrease. Moreover, two constructions of resilient functions are provided, which have optimal degree of completeness, high nonlinearity, and high algebraic degree.
基金supported by the National Natural Science Foundation of China (No.60674022,60736022,60821091)
文摘The structure of a canalizing function is discussed. Using a new matrix product, namely semitensor product, the logical function is expressed in its matrix form. From its matrix expression, a criterion is obtained to test whether a logical function is a canalizing function. Then a formula is obtained to calculate the number of canalizing functions. Moreover, an algorithm is presented to generate canalizing functions. Finally, some results obtained are extended to seminested canalizing functions.
基金Supported by the National Nature Science Foundation of China（ No. 60773003,60970120）.
文摘Based on the relationship between cheating immune secret sharing and cryptographic criteria of Boolean functions, to design a cheating immune secret sharing scheme, a 1-resilient function satisfying the strict avalanche criterion （SAC） is needed. In this paper, a technique on constructing a cheating immune secret sharing function is studied. By using Maiorana-McFarland construction technique, two new methods to construct cheating immune secret sharing functions are proposed.
文摘This study reveals the successful design of the data acquisition system for pH sensors.The data acquisition system includes an instrumentation amplifier,a low pass filter and a calculation program.The instrumentation amplifier used as the readout circuit has many advantages,including high input impedance,high gain,low output impedance,high CMRR and high bandwidth.The low pass filter is employed to cancel the circuit noise.The calculation program uses the two-point calibration method to calculate the sample concentration.Furthermore,this study employs Boolean function to cancel error signals.As indicated by experimental results,the readout circuit obtains the sensing signal and the calculation program calculates the pH value.Hence,this study successfully fabricates an effective data acquisition system for pH sensors.
基金Acknowledgments This work was supported in part by 973 Project of China （No. 2007CB311201）, the Notional Natural Science Foundation（No. 60833008, 60803149）, and the Foundation of Guangxi Key Laboratory of Information and Communication（No. 20902）.
文摘Based on the properties of trace functions and quadratic forms, this paper presents value distributions of Walsh spectrum of the Plateaued functions of the form Tr（R（x）） with n=3r or 4r variables, where r 〉 1 is an odd integer. Our results can be used to determine the numbers of non-zero Walsh spectrum values and the nonlinearities of these functions, and estimate their resiliency orders. Especially, the value distributions can be used to deduce the tight lower bounds of the second order nonlinearity of two classes of Boolean functions. It is demonstrated that our bounds are better than the previously obtained bounds.
基金Supported by the National Natural Science Foundation of China (60773002)the National High Technology Research and Development Program of China (863 Program) (2007AA01Z472)
文摘A class of semi-bent functions with an even number of variables is constructed by using the values of Kloosterman sums.These semi-bent functions are Boolean functions with four trace terms.Moreover,it is shown that the algebraic degrees of the new semi-bent functions attain the maximum values.
文摘Recently there has been great interest in the idea that evolvable system based on the principle of artifcial intelligence can be used to continuously and autonomously adapt the behaviour of physically embedded systems such as autonomous mobile robots and intelligent home devices. Meanwhile, we have seen the introduction of evolvable hardware(EHW): new integrated electronic circuits that are able to continuously evolve to adapt the chages in the environment implemented by evolutionary algorithms such as genetic algorithm(GA) and reinforcement learning. This paper concentrates on developing a robotic navigation system whose basic behaviours are obstacle avoidance and light source navigation. The results demonstrate that the intrinsic evolvable hardware system is able to create the stable robotiiuc behaviours as required in the real world instead of the traditional hardware systems.
文摘After Google reported its realization of quantum supremacy,Solving the classical problems with quantum computing is becoming a valuable research topic.Switching function minimization is an important problem in Electronic Design Automation(EDA)and logic synthesis,most of the solutions are based on heuristic algorithms with a classical computer,it is a good practice to solve this problem with a quantum processer.In this paper,we introduce a new hybrid classic quantum algorithm using Grover’s algorithm and symmetric functions to minimize small Disjoint Sum of Product(DSOP)and Sum of Product(SOP)for Boolean switching functions.Our method is based on graph partitions for arbitrary graphs to regular graphs,which can be solved by a Grover-based quantum searching algorithm we proposed.The Oracle for this quantum algorithm is built from Boolean symmetric functions and implemented with Lattice diagrams.It is shown analytically and verified by simulations on a quantum simulator that our methods can find all solutions to these problems.
基金Supported by the National Natural Science Foundations of China （No. 60773003, 60970120, 60903180）, the Natural Science Basic Research Plan in Shanx/Province of China （No. S JOB -ZTI4 ）, and the Fundamental Research Funds For the Central Universities and the 111 Project （ No. B08038 ）.
文摘The main results in this paper are to construct two classes of plateaued functions with desirable cryptographic properties. By using the Maiorana-McFarland construction, a class of highly nonlinear resilient plateaued functions satisfying the propagation criterion has been obtained. Johansson,s et al＇ s construction is modified slightly to obtain highly nonlinear multi-output resilient plateaued functions.
