Construction of Ternary Bent Functions From Ternary Linear Functions

Milena Stankovic, Radomir S. Stankovic, Claudio Moraga, Jaakko T. Astola

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Abstract

As in the binary case, ternary bent functions are defined as most non-linear ternary functions meaning that they are at the largest possible Hamming distance from affine ternary functions. It is therefore interesting to observe that some ternary bent functions can be constructed as various combinations of linear ternary functions. By starting from the combination of linear functions corresponding to the basic ternary bent functions the construction of different other ternary bent functions can be performed by the application of different combinations of FFT-like permutation matrices for ternary functions.

Original languageEnglish
Title of host publicationProceedings - 2022 IEEE 52nd International Symposium on Multiple-Valued Logic, ISMVL 2022
PublisherIEEE
Pages50-55
Number of pages6
ISBN (Electronic)9781665423953
DOIs
Publication statusPublished - 2022
Publication typeA4 Article in conference proceedings
Event IEEE International Symposium on Multiple-Valued Logic - , United States
Duration: 18 May 202220 May 2022

Publication series

NameProceedings : International Symposium on Multiple-Valued Logic
Volume2022-May
ISSN (Print)0195-623X
ISSN (Electronic)2378-2226

Conference

Conference IEEE International Symposium on Multiple-Valued Logic
Country/TerritoryUnited States
Period18/05/2220/05/22

Keywords

  • Bent functions
  • Fast Fourier transform
  • Linear functions
  • Permutation matrices
  • Ternary functions
  • Vilenkin-Chrestenson transform

Publication forum classification

  • Publication forum level 1

ASJC Scopus subject areas

  • General Computer Science
  • General Mathematics

Fingerprint

Dive into the research topics of 'Construction of Ternary Bent Functions From Ternary Linear Functions'. Together they form a unique fingerprint.

Cite this