Algebraic construction of near-bent and APN functions

DOI10.1007/s00006-019-1012-xzbMath1468.94972OpenAlexW2982094803WikidataQ126860625 ScholiaQ126860625MaRDI QIDQ2010539

Prasanna Poojary, Vadiraja G. R. Bhatta, Harikrishnan Panackal

Publication date: 27 November 2019

Published in: Advances in Applied Clifford Algebras (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00006-019-1012-x

zbMATH Keywords

traceBoolean functionsAPN functionalmost-bent functionClifford productnear-bent functions

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Boolean functions (94D10)

Related Items (1)

Algebraic construction of near-bent function with application to cryptography

Uses Software

• CLIFFORD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Boolean functions and their applications in cryptography
• Near bent functions on a hyperplane
• On ``bent functions
• Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
• A new characterization of semi-bent and bent functions on finite fields
• Construction of bent functions via Niho power functions
• Mathematics of Clifford -- a Maple package for Clifford and Graßmann algebras
• Boolean and Vectorial Plateaued Functions and APN Functions
• On Bent and Semi-Bent Quadratic Boolean Functions
• Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case
• A Parallel Efficient Architecture for Large Cryptographically Robust n × k (k>n/2) Mappings
• Bent Functions
• The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
• Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
• Fast Software Encryption
• On the Walsh Functions

This page was built for publication: Algebraic construction of near-bent and APN functions