Search for Linearizing Sets in Algebraic Cryptanalysis as a Problem of Pseudo-Boolean Optimization

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

Available in full text

Date
Authors
Publisher

Tomsk State University

Related search

A Depth-First Search Algorithm for Computing Pseudo-Closed Sets

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Algebraic Cryptanalysis of Block Ciphers

2019English

Compact Quadratizations for Pseudo-Boolean Functions

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2019English

Algebraic Precomputations in Differential and Integral Cryptanalysis

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Interpolation Search for Swarm Intelligence to Optimization Problem

Proceedings of the ISCIE International Symposium on Stochastic Systems Theory and its Applications
2012English

Parameter Optimization of Cuckoo Search Algorithm for Multi Dimensional Function Optimization Problem

Communications on Applied Electronics
2018English

Hierarchies of Local Monotonicities and Lattice Derivatives for Boolean and Pseudo-Boolean Functions

2012English

The Algebraic Immunity of Boolean Functions

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

A Translation of Pseudo-Boolean Constraints to SAT

Journal on Satisfiability, Boolean Modeling and Computation
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy