Boolean functions constructed using digital sequences of linear recurrences

DOI10.1515/DMA-2025-0016MaRDI QIDQ6905552zbMATH OpenFDO

Authors Andrey A. Gruba

Publication date 6 November 2025

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/DMA-2025-0016

zbMATH Keywords

Boolean functionslinear recurring sequencesnonlinearity of Boolean functions

Mathematics Subject Classification ID

Recurrences (11B37) Boolean functions (94D10)

Cites work

• A class of injective compressing maps on linear recurring sequences over a Galois ring
• Bent functions from a finite abelian group into a finite abelian group
• Boolean functions in coding theory and cryptology. With a foreword by V. A. Sadovnichij
• CYCLE TYPES OF LINEAR SUBSTITUTIONS OVER FINITE COMMUTATIVE RINGS
• Estimating the number of solutions of systems of nonlinear equations with linear recurring arguments by the spectral method
• Frequency characteristics of linear recurrence sequences over Galois rings
• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 2120400 (Why is no real title available?)
• Parameters of Boolean functions generated by the most significant bits of linear recurrent sequences
• Метод тригонометрических сумм для исследования частот $r$-грамм в старших координатных последовательностях линейных рекуррент над кольцо
• Параметры одного класса функций, заданных на конечном поле

Cited in

(1)

• On the development of scientific directions proposed by A. A. Nechaev

This page was built for publication: Boolean functions constructed using digital sequences of linear recurrences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6905552)