Algebraic construction of near-bent function with application to cryptography

Vadiraja G.R. Bhatta, Harikrishnan Panackal, Prasanna Poojary*, Shashi Kant Pandey

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

Near-bent functions that occur in odd dimensions are the important class of Boolean functions, which are useful functions for cryptography. In this paper, we construct near-bent function with trace term using well known Welch function exponent in polynomial form and various other forms of near-bent functions. We have also investigated some important cryptographical properties of near-bent functions.

Original languageEnglish
Pages (from-to)527-540
Number of pages14
JournalJournal of Discrete Mathematical Sciences and Cryptography
Volume24
Issue number2
DOIs
Publication statusPublished - 2021

All Science Journal Classification (ASJC) codes

  • Analysis
  • Algebra and Number Theory
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Algebraic construction of near-bent function with application to cryptography'. Together they form a unique fingerprint.

Cite this