Class of Boolean Functions Constructed Using Significant Bits of Linear Recurrences Over the Ring Z2n

Prikladnaya diskretnaya matematika. Prilozhenie
doi 10.17223/2226308x/12/23
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Tomsk State University

Related search

Cryptographically Significant Boolean Functions: Construction and Analysis in Terms of Algebraic Immunity

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Steganalysis of Embedding in Two Least-Significant Bits

IEEE Transactions on Information Forensics and Security
RiskComputer NetworksCommunicationsReliabilitySafetyQuality
2007English

The Algebraic Immunity of Boolean Functions

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

Symbolic Manipulation of Boolean Functions Using a Graphical Representation

1985English

Robust Signature-Based Copyright Protection Scheme Using the Most Significant Gray-Scale Bits of the Image

Advances in Multimedia
Computer Science
2012English

On Certain Class of Analytic Functions Involving Linear Operators

IOSR Journal of Mathematics
2013English

The Complexity of Linear-Time Temporal Logic Over the Class of Ordinals

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2010English

An Evolutionary Multiobjective Approach to Design Highly Non-Linear Boolean Functions

2007English

The Monotone Circuit Complexity of Boolean Functions

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
1987English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy