2004IACR Cryptology ePrint ArchiveRequires access

ON THE DEGREE OF HOMOGENEOUS BENT FUNCTIONS.

Qingshu Meng, Huanguo Zhang, Min Jian Yang, Jingsong Cui

Open publisher page 0 citations

Abstract

In this paper, the degree of homogeneous bent functions is discussed. We prove that for any nonnegative integer k, there exists a positive integer N such that for n>=N there exist no 2n- variable homogeneous bent functions having degree n-k or more, where N is the least integer satisfying 2^N^-^1>N+10+N+11+...+N+1k+1.

About this research paper

What this paper is about

In this paper, the degree of homogeneous bent functions is discussed. We prove that for any nonnegative integer k, there exists a positive integer N such that for n>=N there exist no 2n- variable homogeneous bent functions having degree n-k or more, where N is the least integer satisfying 2^N^-^1>N+10+N+11+...+N+1k+1.

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

In this paper, the degree of homogeneous bent functions is discussed. We prove that for any nonnegative integer k, there exists a positive integer N such that for n>=N there exist no 2n- variable homogeneous bent functions having degree n-k or more, where N is the least integer satisfying 2^N^-^1>N+10+N+11+...+N+1k+1.

Key concepts: Bent molecular geometry, Homogeneous, Integer (computer science), Degree (music), Combinatorics, Mathematics, Variable (mathematics), Function (biology)

Related papers

Back to paper searchBrowse research topicsOriginal source
ON THE DEGREE OF HOMOGENEOUS BENT FUNCTIONS. — Research Paper | ScholarLens