ScholarLens Back to search
2012•Applied Mechanics and MaterialsRequires access

Study on Algorithm of Same Judgment on Nonlinear Boolean Functions’ Logical Expressions Structure

Hong Yan Li

Open publisher page 0 citations

Abstract

The nonlinear Boolean function (NBF) is an indispensable tool in design and analysis of cryptosystem. Algorithm of the same judgment on two NBF logical expressions has wide needs in Boolean function application. However, the algorithm is more complicated. In this article, an algorithm of the same judgment on two NBF logical expressions based on ROBDD is put forward. Combined with advantages of the array and hash table, ROBDD expression node data structure Unique Table of NBF is designed. Its time complexity of same judgment is O(6(max(id)-2)).

About this research paper

What this paper is about

The nonlinear Boolean function (NBF) is an indispensable tool in design and analysis of cryptosystem. Algorithm of the same judgment on two NBF logical expressions has wide needs in Boolean function application. However, the algorithm is more complicated. In this article, an algorithm of the same judgment on two NBF logical expressions based on ROBDD is put forward. Combined with advantages of the array and hash table, ROBDD expression node data structure Unique Table of NBF is designed. Its time complexity of same judgment is O(6(max(id)-2)).

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The nonlinear Boolean function (NBF) is an indispensable tool in design and analysis of cryptosystem. Algorithm of the same judgment on two NBF logical expressions has wide needs in Boolean function application. However, the algorithm is more complicated. In this article, an algorithm of the same judgment on two NBF logical expressions based on ROBDD is put forward. Combined with advantages of the array and hash table, ROBDD expression node data structure Unique Table of NBF is designed. Its time complexity of same judgment is O(6(max(id)-2)).

Key concepts: Boolean function, Boolean expression, Truth table, And-inverter graph, Boolean network, Algorithm, Hash function, Computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Study on Algorithm of Same Judgment on Nonlinear Boolean Functions’ Logical Expressions Structure — Research Paper | ScholarLens