Construction of ternary bent functions by FFT-like permutation algorithms

Radomir S. Stanković; Milena Stanković; Claudio Moraga; Jaakko T. Astola

doi:10.1587/transinf.2020LOP0006

Construction of ternary bent functions by FFT-like permutation algorithms

Radomir S. Stanković, Milena Stanković, Claudio Moraga, Jaakko T. Astola

Computing Sciences

Research output: Contribution to journal › Article › Scientific › peer-review

Abstract

Binary bent functions have a strictly specified number of non-zero values. In the same way, ternary bent functions satisfy certain requirements on the elements of their value vectors. These requirements can be used to specify six classes of ternary bent functions. Classes are mutually related by encoding of function values. Given a basic ternary bent function, other functions in the same class can be constructed by permutation matrices having a block structure similar to that of the factor matrices appearing in the Good-Thomas decomposition of Cooley-Tukey Fast Fourier transform and related algorithms.

Original language	English
Pages (from-to)	1092-1102
Number of pages	11
Journal	IEICE Transactions on Information and Systems
Volume	E104D
Issue number	8
DOIs	https://doi.org/10.1587/transinf.2020LOP0006
Publication status	Published - 2021
Publication type	A1 Journal article-refereed

Keywords

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

Publication forum classification

Publication forum level 1

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Vision and Pattern Recognition
Electrical and Electronic Engineering
Artificial Intelligence

Access to Document

10.1587/transinf.2020LOP0006

Cite this

@article{7f60f1db021d4360a8825a859beda0da,

title = "Construction of ternary bent functions by FFT-like permutation algorithms",

abstract = "Binary bent functions have a strictly specified number of non-zero values. In the same way, ternary bent functions satisfy certain requirements on the elements of their value vectors. These requirements can be used to specify six classes of ternary bent functions. Classes are mutually related by encoding of function values. Given a basic ternary bent function, other functions in the same class can be constructed by permutation matrices having a block structure similar to that of the factor matrices appearing in the Good-Thomas decomposition of Cooley-Tukey Fast Fourier transform and related algorithms.",

keywords = "Bent functions, Fast Fourier transform, Permutation matrices, Ternary functions, Vilenkin-Chrestenson transform",

author = "Stankovi{\'c}, {Radomir S.} and Milena Stankovi{\'c} and Claudio Moraga and Astola, {Jaakko T.}",

note = "Publisher Copyright: {\textcopyright} 2021 The Institute of Electronics, Information and Communication Engineers",

year = "2021",

doi = "10.1587/transinf.2020LOP0006",

language = "English",

volume = "E104D",

pages = "1092--1102",

journal = "IEICE Transactions on Information and Systems",

issn = "0916-8532",

publisher = "Institute of Electronics, Information and Communication Engineers",

number = "8",

}

TY - JOUR

T1 - Construction of ternary bent functions by FFT-like permutation algorithms

AU - Stanković, Radomir S.

AU - Stanković, Milena

AU - Moraga, Claudio

AU - Astola, Jaakko T.

PY - 2021

Y1 - 2021

N2 - Binary bent functions have a strictly specified number of non-zero values. In the same way, ternary bent functions satisfy certain requirements on the elements of their value vectors. These requirements can be used to specify six classes of ternary bent functions. Classes are mutually related by encoding of function values. Given a basic ternary bent function, other functions in the same class can be constructed by permutation matrices having a block structure similar to that of the factor matrices appearing in the Good-Thomas decomposition of Cooley-Tukey Fast Fourier transform and related algorithms.

AB - Binary bent functions have a strictly specified number of non-zero values. In the same way, ternary bent functions satisfy certain requirements on the elements of their value vectors. These requirements can be used to specify six classes of ternary bent functions. Classes are mutually related by encoding of function values. Given a basic ternary bent function, other functions in the same class can be constructed by permutation matrices having a block structure similar to that of the factor matrices appearing in the Good-Thomas decomposition of Cooley-Tukey Fast Fourier transform and related algorithms.

KW - Bent functions

KW - Fast Fourier transform

KW - Permutation matrices

KW - Ternary functions

KW - Vilenkin-Chrestenson transform

U2 - 10.1587/transinf.2020LOP0006

DO - 10.1587/transinf.2020LOP0006

M3 - Article

AN - SCOPUS:85112021486

SN - 0916-8532

VL - E104D

SP - 1092

EP - 1102

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

IS - 8

ER -

Construction of ternary bent functions by FFT-like permutation algorithms

Abstract

Keywords

Publication forum classification

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this