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)).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
