Enumeration of Boolean Functions With a Fixed Number of Affine Products

Prikladnaya diskretnaya matematika. Prilozhenie
doi 10.17223/2226308x/8/17
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Tomsk State University

Related search

Constructions of Generalized Bent Boolean Functions on Odd Number of Variables

International Journal of Hybrid Information Technology
Computer Science
2015English

Cryptographic Boolean Functions With R

R Journal
UncertaintyNumerical AnalysisStatisticsProbability
2011English

Classes of Boolean Functions With Limited Complexity

Prikladnaya diskretnaya matematika. Prilozhenie
2019English

Counting Boolean Functions With Faster Points

Designs, Codes, and Cryptography
CombinatoricsApplied MathematicsComputer Science ApplicationsTheoretical Computer ScienceDiscrete Mathematics
2020English

A New Method on Constructing Boolean Functions Satisfying the Strict Avalanche Criterion and Bounds on the Number of SAC Functions

DEStech Transactions on Computer Science and Engineering
2017English

Properties of Associated Boolean Functions of Quadratic APN Functions

Prikladnaya diskretnaya matematika. Prilozhenie
2019English

Recognition of Digital Polyhedra With a Fixed Number of Faces

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Tiling the Plane With a Fixed Number of Polyominoes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

The Algebraic Immunity of Boolean Functions

Prikladnaya Diskretnaya Matematika
Signal ProcessingCombinatoricsApplied MathematicsMathematicsDiscrete MathematicsComputational TheoryTheoretical Computer Science
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy