Research on reconfigurable nonlinear Boolean functions hardware structure targeted at stream cipher

2009 ◽  
Author(s):  
Xueying Zhang ◽  
Zibin Dai ◽  
Wei Li ◽  
Longmei Nan
Keyword(s):  
Boolean Functions ◽  
Stream Cipher ◽  
Hardware Structure

SAT-Based Generation of Optimum Circuits with Polymorphic Behavior Support

2019 ◽  
Vol 28 (supp01) ◽  
pp. 1940010
Author(s):  
Petr Fišer ◽  
Ivo Háleček ◽  
Jan Schmidt ◽  
Václav Šimek
Keyword(s):  
Boolean Functions ◽  
Equivalence Classes ◽  
Experimental Results ◽  
Behavior Support ◽  
Operating Environment ◽  
Polymorphic Behavior ◽  
Multi Level ◽  
Boolean Optimization ◽  
Hardware Structure

This paper presents a method for generating optimum multi-level implementations of Boolean functions based on Satisfiability (SAT) and Pseudo-Boolean Optimization (PBO) problems solving. The method is able to generate one or enumerate all optimum implementations, while the allowed target gate types and gates costs can be arbitrarily specified. Polymorphic circuits represent a newly emerging computation paradigm, where one hardware structure is capable of performing two or more different intended functions, depending on instantaneous conditions in the target operating environment. In this paper we propose the first method ever, generating provably size-optimal polymorphic circuits. Scalability and feasibility of the method are documented by providing experimental results for all NPN-equivalence classes of four-input functions implemented in AND–Inverter and AND–XOR–Inverter logics without polymorphic behavior support being used and for all pairs of NPN–equivalence classes of three-input functions for polymorphic circuits. Finally, several smaller benchmark circuits were synthesized optimally, both in standard and polymorphic logics.

Research on Optimization Algorithm of Reconfigurable Logical Operation Resource Configuration

2013 ◽  
Vol 756-759 ◽  
pp. 1968-1972
Author(s):  
Hong Yan Li ◽  
Fei Gao
Keyword(s):  
Optimization Algorithm ◽  
Boolean Functions ◽  
Time Complexity ◽  
Stream Cipher ◽  
Reconfigurable Systems ◽  
Logical Operation ◽  
Resource Configuration ◽  
Reconfigurable Design ◽  
Logic Computation ◽  
Configuration Information

In reconfigurable systems, how to take full advantage of the limited reusable resource through configuration information to achieve better system function is difficult. In this article, an optimization algorithm of resource allocation for reconfigurable Boolean function logic computation resource based on cupidity arithmetic ideas is proposed, which is used in reconfigurable design for stream cipher algorithm. The algorithm selects a series of configurations from several different configurations of Boolean functions in order to get the best result overall in achieving optimal utilization of reconfigurable resources. The algorithm's time complexity is O (nm), space complexity is S (nm). Finally, an application example is given.

scholarly journals Findings Annihilator(s) via Fault Injection Attack (FIA) on Boolean Function of Grain v0

2019 ◽  
Vol 24 ◽  
pp. 02009
Author(s):  
Muhammad Rezal Kamel Ariffin ◽  
Wan Zariman Omar@Othman ◽  
Solahuddin Shamsuddin ◽  
Zahari Mahad ◽  
Suhairi Mohd Jawi
Keyword(s):  
Boolean Function ◽  
Boolean Functions ◽  
Stream Cipher ◽  
Fault Injection ◽  
Algebraic Attacks ◽  
Low Degree ◽  
Fault Injection Attack

In developing stream cipher algorithms, Boolean function is one of vital elements. Attacks on LFSR-based stream cipher is the challenge for the cryptanalyst to get low-degree annihilator(s). In this paper, we proposed Fault Injection Attack (FIA) on Boolean function of Grain v0, which is the original variant of Grain family algorithm. Fault injection attack (FIA) is used on Boolean function of Grain v0 by replacing certain coefficient with value of one (1) which results in the generation of several injected Boolean functions. With these injected Boolean function, we proceed using HAO’s algorithm to find annihilator(s). As a result, we obtained several new annihilator(s) of Grain v0’s Boolean function. This new annihilator(s) will be utilized to launch algebraic attacks upon Grain v0.

CLASS OF BOOLEAN FUNCTIONS CONSTRUCTED USING SIGNIFICANT BITS OF LINEAR RECURRENCES OVER THE RING ℤ2n

2019 ◽  
Vol 6 (2) ◽  
pp. 90-94
Author(s):  
Hernandez Piloto Daniel Humberto
Keyword(s):  
Linear Function ◽  
Boolean Functions ◽  
Hamming Distance ◽  
Linear Recurrences ◽  
Maximum Period ◽  
Non Linear ◽  
The Given ◽  
Class Of Functions

In this work a class of functions is studied, which are built with the help of significant bits sequences on the ring ℤ2n. This class is built with use of a function ψ: ℤ2n → ℤ2. In public literature there are works in which ψ is a linear function. Here we will use a non-linear ψ function for this set. It is known that the period of a polynomial F in the ring ℤ2n is equal to T(mod 2)2α, where α∈ , n01- . The polynomials for which it is true that T(F) = T(F mod 2), in other words α = 0, are called marked polynomials. For our class we are going to use a polynomial with a maximum period as the characteristic polyomial. In the present work we show the bounds of the given class: non-linearity, the weight of the functions, the Hamming distance between functions. The Hamming distance between these functions and functions of other known classes is also given.

On the Signal-to-Noise Ratio for Boolean Functions

2020 ◽  
Vol E103.A (12) ◽  
pp. 1659-1665
Author(s):  
Yu ZHOU ◽  
Wei ZHAO ◽  
Zhixiong CHEN ◽  
Weiqiong WANG ◽  
Xiaoni DU
Keyword(s):  
Boolean Functions ◽  
Signal To Noise Ratio ◽  
Signal To Noise ◽  
Noise Ratio
Sign in / Sign up

Export Citation Format

Share Document