Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2193-1801
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions ; volume:5 ; number:1 ; day:30 ; month:4 ; year:2016 ; pages:1-16 ; date:12.2016
SpringerPlus ; 5, Heft 1 (30.4.2016), 1-16, 12.2016
- Creator
-
Semenov, Alexander
- Contributor
-
Zaikin, Oleg
SpringerLink (Online service)
- DOI
-
10.1186/s40064-016-2187-4
- URN
-
urn:nbn:de:1111-201605041585
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:50 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Semenov, Alexander
- Zaikin, Oleg
- SpringerLink (Online service)
Other Objects (12)
Boolean Satisfiability: Theory and Engineering
Efficient solution of Boolean satisfiability problems with digital memcomputing
The complexity of Boolean functions from cryptographic viewpoint
On cryptographic properties of cubic and splitting Boolean functions
A survey of metaheuristic algorithms for the design of cryptographic Boolean functions
Augmenting an electronic Ising machine to effectively solve boolean satisfiability
A boolean satisfiability approach to the resource-constrained project scheduling problem
Robust algorithms for high quality test pattern generation using Boolean satisfiability
A Logical Deduction Based Clause Learning Algorithm for Boolean Satisfiability Problems
Hybrid multi-criteria decision-making technique for the selection of best cryptographic multivalued Boolean function
Classification of cryptographic libraries
Satisfiability of the smallest binary program
Boolean Satisfiability: Theory and Engineering
Efficient solution of Boolean satisfiability problems with digital memcomputing
The complexity of Boolean functions from cryptographic viewpoint
On cryptographic properties of cubic and splitting Boolean functions
A survey of metaheuristic algorithms for the design of cryptographic Boolean functions
Augmenting an electronic Ising machine to effectively solve boolean satisfiability
A boolean satisfiability approach to the resource-constrained project scheduling problem
Robust algorithms for high quality test pattern generation using Boolean satisfiability
A Logical Deduction Based Clause Learning Algorithm for Boolean Satisfiability Problems
Hybrid multi-criteria decision-making technique for the selection of best cryptographic multivalued Boolean function
Classification of cryptographic libraries
Satisfiability of the smallest binary program
Boolean Satisfiability: Theory and Engineering
Efficient solution of Boolean satisfiability problems with digital memcomputing
The complexity of Boolean functions from cryptographic viewpoint
On cryptographic properties of cubic and splitting Boolean functions
A survey of metaheuristic algorithms for the design of cryptographic Boolean functions
Augmenting an electronic Ising machine to effectively solve boolean satisfiability
A boolean satisfiability approach to the resource-constrained project scheduling problem
Robust algorithms for high quality test pattern generation using Boolean satisfiability
A Logical Deduction Based Clause Learning Algorithm for Boolean Satisfiability Problems
Hybrid multi-criteria decision-making technique for the selection of best cryptographic multivalued Boolean function
Classification of cryptographic libraries