1,567 Hits in 6.4 sec

The Design of Boolean Functions by Modified Hill Climbing Method

Yuriy Izbenko, Vladislav Kovtun, Alexandr Kuznetsov
2009 2009 Sixth International Conference on Information Technology: New Generations  
In this paper the modified hill climbing method is considered.  ...  The method allows using hill climbing techniques to modify bent functions used to design balanced, highly nonlinear Boolean functions with high algebraic degree and low autocorrelation.  ...  Modified Hill Climbing method As pointed in [1, 4] , the hill climbing approach to Boolean function design is a means of improving the nonlinearity of a given Boolean function by making well chosen alterations  ... 
doi:10.1109/itng.2009.102 dblp:conf/itng/IzbenkoKK09 fatcat:zcew3rib7jdmjkpjgwhqd2ghme

Heuristic design of cryptographically strong balanced Boolean functions [chapter]

William Millan, Andrew Clark, Ed Dawson
1998 Lecture Notes in Computer Science  
Advances in the design of Boolean functions using heuristic techniques are reported. A genetic algorithm capable of generating highly nonlinear balanced Boolean functions is presented.  ...  Hill climbing techniques are adapted to locate balanced, highly nonlinear Boolean functions that also almost satisfy correlation immunity.  ...  The methods of gradient descent (or hill climbing (HC) ) and the use of a genetic algorithm have proven useful in the quasi-random generation of highly nonlinear Boolean functions.  ... 
doi:10.1007/bfb0054148 fatcat:ngozn3i3u5cnjanunfrmcnao3y

A New Method for Generating High Non-linearity S-Boxes

P. Tesar
2010 Radioengineering  
The open problem is constructed by generating methods which will be rapid and will generate S-boxes with the highest possible non-linearity.  ...  This paper deals with a new rapid method for generating regular 8x8 S-boxes with non-linearity up to a value of 104. The new method combines the special genetic algorithm with total tree searching.  ...  The method enables the application of hill climbing techniques to modify the bent functions used to design balanced highly non-linear Boolean functions.  ... 
doaj:d7b349934e744ad4a7120de93faba0ab fatcat:rabpms6urbfnfashq3l77pcwra

Efficient Methods for Generating MARS-Like S-Boxes [chapter]

L. Burnett, G. Carter, E. Dawson, W. Millan
2001 Lecture Notes in Computer Science  
This paper provides a faster and more effective alternative generation method using heuristic techniques to produce 9x32 s-boxes with cryptographic properties that are clearly superior to those of the  ...  One of the five AES finalists, MARS, makes use of a 9x32 s-box with very specific combinatorial, differential and linear correlation properties.  ...  The particular technique we chose was a heuristic method known as hill climbing [6] .  ... 
doi:10.1007/3-540-44706-7_21 fatcat:c3u62g3ts5fjdogbi2qmsmua7e

Regulatory genotype-to-phenotype mappings improve evolvability in genetic programming

Jinting Zhang, Ting Hu
2022 Proceedings of the Genetic and Evolutionary Computation Conference Companion  
random walk, hill climbing, and novelty search.  ...  In this study, we propose two genotype-to-phenotype mapping mechanisms for linear genetic programming (LGP), where the execution and output of a linear genetic program are varied by a regulator.  ...  The three search methods include random walk, novelty search, and hill climbing [6, 7] .  ... 
doi:10.1145/3520304.3529043 fatcat:toiuyqgdafhknjhnilmwqjt6we

Improved Objective Functions to Search for 8 × 8 Bijective S-Boxes With Theoretical Resistance Against Power Attacks Under Hamming Leakage Models

Ismel Martinez-Diaz, Alejandro Freyre-Echevarria, Omar Rojas, Guillermo Sosa-Gomez, Carlos Miguel Legon-Perez
2022 IEEE Access  
We apply a Hill Climbing heuristic method over the S-box's space to measure which objective function is better and to compare the obtained S-boxes with the S-boxes in the actual literature.  ...  The design of S-boxes with theoretical resistance against Side-Channel Attacks by power consumption is addressed with properties defined under one of these two models: the Hamming Distance leakage model  ...  HILL CLIMBING ALGORITHM Hill climbing is a meta-heuristic method.  ... 
doi:10.1109/access.2022.3145990 fatcat:hobupbvpkvdida4pb5eido7w2m

On the construction of cryptographically strong boolean functions with desirable trade-off

Ren Kui, Park Jaemin, Kim Kwangjo
2005 Journal of Zhejiang University: Science A  
This algorithm takes bent function as input and directly outputs the resulted Boolean function in terms of truth table sequence.  ...  This is the best result up to now compared to existing ones. Instead of bent sequences, starting from random Boolean functions was also tested in the algorithm.  ...  A technique called hill climbing was introduced by Millan et al.(1997) .  ... 
doi:10.1631/jzus.2005.a0358 fatcat:3f4oiktcmjfqjkk7fr3afd5aka

BTR: training asynchronous Boolean models using single-cell expression data

Chee Yee Lim, Huange Wang, Steven Woodhouse, Nir Piterman, Lorenz Wernisch, Jasmin Fisher, Berthold Göttgens
2016 BMC Bioinformatics  
Given the simplicity of Boolean models and the rapid adoption of single-cell genomics by biologists, BTR has the potential to make an impact across many fields of biomedical research.  ...  We demonstrate that the Boolean scoring function performed favourably against the BIC scoring function for Bayesian networks.  ...  Acknowledgements Research in the authors' laboratory is supported by Bloodwise The funding bodies had no role in the design, collection, analysis, and interpretation of data; in the writing of the manuscript  ... 
doi:10.1186/s12859-016-1235-y pmid:27600248 pmcid:PMC5012073 fatcat:u7ldrnbdifedrd46jhgl2wybte

On the Design of Chaos-Based S-boxes

Miroslav M. Dimitrov
2020 IEEE Access  
In this paper, S-boxes generated by using chaotic functions (CF) are analyzed to measure their actual resistance to linear cryptanalysis.  ...  By using two heuristic methods and starting from pseudo-random S-boxes, we repeatedly reached S-boxes, which significantly outperform all previously published CF-based S-boxes, in those cryptographic terms  ...  By using stochastic 1 hill climbing as heuristic function, starting from arbitrary pseudo-random S-box construction and by using E(S), algorithm 1 is proposed.  ... 
doi:10.1109/access.2020.3004526 fatcat:sszkh4quzngene6wcakaawueqe

Human behaviour based optimization supported with self-organizing maps for solving the S-box design Problem

Ricardo Soto, Broderick Crawford, Francisco Gonzalez, Rodrigo Olivares
2021 IEEE Access  
The cryptanalytic resistance of modern block and stream encryption systems mainly depends on the substitution box (S-box).  ...  The experiments are compared with S-boxes obtained using other metaheuristic algorithms such as Ant Colony Optimization, Genetic Algorithm and an approach based on chaotic functions and show that the obtained  ...  Reference [26] detailed the clonal selection algorithm, that is a form of artificial immune algorithm, mixed with a modified hill climbing method.  ... 
doi:10.1109/access.2021.3087139 fatcat:6j3lp5nuubf2rgb4lqheylzhmm

Optimization Approach for the Development of Humanoid Robots' Behaviors [chapter]

Luis Cruz, Luis Paulo Reis, Nuno Lau, Armando Sousa
2012 Lecture Notes in Computer Science  
The paper describes the adopted architecture, main design choices and the results achieved with the optimization of a side kick and a forward kick.  ...  In this work, the SimSpark simulator of the Simulation 3D will be used.  ...  The graphs of Figure 3 present the evolution of the fitness score of the best and current solutions, for both Hill Climbing and Tabu Search methods.  ... 
doi:10.1007/978-3-642-34654-5_50 fatcat:ve2miwet6vg5fnzww7eyzkdjdi

CARAF: Complex Aggregates within Random Forests [chapter]

Clément Charnay, Nicolas Lachiche, Agnès Braud
2016 Lecture Notes in Computer Science  
Firstly, it aims at avoiding exhaustive exploration of the large feature space induced by the use of complex aggregates.  ...  Its second purpose is to reduce the overfitting introduced by the expressivity of complex aggregates in the context of a single decision tree.  ...  Algorithm for One Branch 1: Input: train: labelled training set 2: Output: hasImproved : boolean indicating if the step of the hill-climbing has improved the best split found in the current hill-climbing  ... 
doi:10.1007/978-3-319-40566-7_2 fatcat:vhlsdmqngrfwve5dgckjqer4ra

Cryptographic Boolean functions: One output, many design criteria

Stjepan Picek, Domagoj Jakobovic, Julian F. Miller, Lejla Batina, Marko Cupic
2016 Applied Soft Computing  
Boolean functions represent an important primitive in the design of various cryptographic algorithms.  ...  Thus, methods to generate Boolean functions that possess good cryptographic properties is an important research goal.  ...  Acknowledgments This work was supported in part by the Technology Foundation STW (project 12624 -SIDES), The Netherlands Organization for Scientific Research NWO (project ProFIL 628.001.007) and the ICT  ... 
doi:10.1016/j.asoc.2015.10.066 fatcat:4l2gjsw6frc6zhwebmq5orhtva

Evolutionary Algorithms for Boolean Functions in Diverse Domains of Cryptography

Stjepan Picek, Claude Carlet, Sylvain Guilley, Julian F. Miller, Domagoj Jakobovic
2016 Evolutionary Computation  
Therefore, various methods for the construction of Boolean functions with desired properties are of direct interest.  ...  This paper concentrates on two scenarios for use of Boolean functions in cryptography. The first uses Boolean functions as the source of the nonlinearity in filter and combiner generators.  ...  Acknowledgments This work has been supported in part by Croatian Science Foundation under the project IP-2014-09-4882.  ... 
doi:10.1162/evco_a_00190 pmid:27482749 fatcat:sdnzswapgbesnmr4tzeuieorki

Hill Climbing Algorithms and Trivium [chapter]

Julia Borghoff, Lars R. Knudsen, Krystian Matusiewicz
2011 Lecture Notes in Computer Science  
We show how heuristic optimization methods such as hill climbing algorithms can be relevant to solving systems of multivariate equations.  ...  As an example, we investigate equation systems induced by the problem of recovering the internal state of the stream cipher Trivium.  ...  We would like to thank the anonymous reviewers of SAC 2010 and Tools for Cryptanalysis 2010 for their comments that helped to improve this paper.  ... 
doi:10.1007/978-3-642-19574-7_4 fatcat:ges4jyf4s5b5vl4ypcgfxnynhq
« Previous Showing results 1 — 15 out of 1,567 results