A New Algorithm for Enumerating Bent Functions Based on Truth Tables and Run Length | Zendy

Yongbin Zhao | Zendy; Ning Cao | Zendy; Zhaohui Qi | Zendy; Guofu Li | Zendy; Pingzeng Liu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A New Algorithm for Enumerating Bent Functions Based on Truth Tables and Run Length

Author(s) -

Yongbin Zhao,

Ning Cao,

Zhaohui Qi,

Guofu Li,

Pingzeng Liu

Publication year - 2018

Publication title -

ieee access

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.587

H-Index - 127

ISSN - 2169-3536

DOI - 10.1109/access.2017.2787618

Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation

In this paper, we first provide some properties of truth tables of bent functions. Furthermore, a upper bound of truth table's runs length of a bent function is presented. Based on these results, we propose a new algorithm for enumerating bent functions. At last, we find that our algorithm requires lower storage complexity and is easier to implement with parallel/distributed computing infrastructures by comparing with some known searching algorithms.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research