Filters








6,787 Hits in 3.2 sec

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

An O (N log N) Algorithm for Boolean Mask Operations

U. Lauther
1981 18th Design Automation Conference  
Abstrac, t A new algorithm is presented which calculates Boolean combinations (AND, OR, F/OR, AND NOT) between two layers of an integrated circuit layout.  ...  Input and output of the algorithm is an edgebased description of the set of polygons which represent the artwork.  ...  limited main memory allowing fast random access and a practically unlimited peripheral storage, for which fast access is possible only in a set'a3. manner.  ... 
doi:10.1109/dac.1981.1585410 fatcat:uvi3j4n7mzcy5euqavyjfvf6iy

Optimal First-Order Boolean Masking for Embedded IoT Devices [chapter]

Alex Biryukov, Daniel Dinu, Yann Le Corre, Aleksei Udovenko
2018 Lecture Notes in Computer Science  
The best known expressions for Boolean masking of bitwise operations are relatively compact, but even a small improvement of these expressions can significantly reduce the performance penalty of more complex  ...  To this end, we describe an algorithm for efficient search of expressions that have an optimal cost in number of elementary operations.  ...  The authors thank the anonymous reviewers for their valuable comments. The work of Aleksei Udovenko is supported by the Fonds National de la Recherche, Luxembourg (project reference 9037104).  ... 
doi:10.1007/978-3-319-75208-2_2 fatcat:fimqzo4inzbdfgz5bh6r22l3r4

Fast Correlation Attacks over Extension Fields, Large-Unit Linear Approximation and Cryptanalysis of SNOW 2.0 [chapter]

Bin Zhang, Chao Xu, Willi Meier
2015 Lecture Notes in Computer Science  
We adapt the k-tree algorithm [24] to generate the desirable parity check equations in the pre-computation phase and propose a fast decoding algorithm for the online phase.  ...  Our decoding algorithm makes use of Fast Walsh Transform (FWT) to get a better performance.  ...  Here we present a fast decoding algorithm, which can be seen as a solution to this problem.  ... 
doi:10.1007/978-3-662-47989-6_31 fatcat:f3m35llwyjgavmwwlwtg7wfwte

Some Problems and Algorithms Related to the Weight Order Relation on the n-dimensional Boolean Cube [article]

Valentin Bakoev
2020 arXiv   pre-print
It is closely related to the problem of fast computing the algebraic degree of Boolean functions.  ...  Two algorithms for solving the problem considered are developed–the first one works in a byte-wise manner and uses the WLO sequence, and the second one works in a bitwise manner and uses the characteristic  ...  Acknowledgments: The author is grateful for the partial support from the Research Fund of the University of Veliko Tarnovo, Bulgaria, under Contract FSD-31-340-14/26.03.2019.  ... 
arXiv:1811.04421v3 fatcat:vbzmpsed2jfn7m2hugdbl6ehem

Page 9827 of Mathematical Reviews Vol. , Issue 2003m [page]

2003 Mathematical Reviews  
There is thus a need for a method to convert back and forth between Boolean masking and arithmetic masking. “A first solution to this problem was proposed by Thomas S.  ...  “However, for algorithms that combine Boolean and arithmetic functions, such as IDEA or several of the AES candidates, two different kinds of masking have to be used.  ... 

Algorithms for Switching between Boolean and Arithmetic Masking of Second Order [chapter]

Praveen Kumar Vadnala, Johann Großschädl
2013 Lecture Notes in Computer Science  
This paper presents the first solution to the problem of converting between Boolean and arithmetic masking of second order.  ...  When used to protect a cryptographic algorithm that performs both Boolean and arithmetic operations, it is necessary to change the masks from one form to the other in order to be able to unmask the secret  ...  Coron and Tchulkine proposed a new algorithm for conversion from arithmetic to Boolean masking [5] .  ... 
doi:10.1007/978-3-642-41224-0_8 fatcat:ckws7mditrcdlpj4cyvs7knnpy

Secure Multiple SBoxes Implementation with Arithmetically Masked Input [chapter]

Luk Bettale
2013 Lecture Notes in Computer Science  
A method using state of the art algorithms would be to first perform an arithmetic to boolean mask conversion before independently accessing the N SBoxes.  ...  Propagating the masks through non-linear functions is a necessary task to achieve a sound and secure masked implementation.  ...  When the input a of multiple SBoxes is masked with boolean masking, the application of Alg. 1 to each small SBox is straightforward because each part m i of a boolean mask m is a boolean mask for the corresponding  ... 
doi:10.1007/978-3-642-37288-9_7 fatcat:pahgbe7eh5hhfggrkv4ds7q4gu

Parallel Computation Using Active Self-assembly [chapter]

Moya Chen, Doris Xin, Damien Woods
2013 Lecture Notes in Computer Science  
Along the way, we give fast parallel algorithms for a number of problems including line growth, sorting, Boolean matrix multiplication and space-bounded Turing machine simulation, all using a constant  ...  In computational complexity terms, we show that any problem from the complexity class NC is solved in polylogarithmic expected time on nubots that use a polynomial amount of workspace.  ...  We thank Erik Winfree for valuable discussion and suggestions on our results, Paul Rothemund for stimulating conversations on molecular muscle, Niall Murphy for informative discussions on circuit complexity  ... 
doi:10.1007/978-3-319-01928-4_2 fatcat:oakcogkqyrbwlllamx3aq6yyxq

On Multidimensional Linear Cryptanalysis [chapter]

Phuong Ha Nguyen, Lei Wei, Huaxiong Wang, San Ling
2010 Lecture Notes in Computer Science  
We derive the formula for N , the number of samples required for the attack and we improve the algorithm by reducing time complexity of the distillation phase from 2 m N to 2m2 m + mN , and that of the  ...  We apply the results on 4-and 9-round Serpent and show that Hermelin et al. actually provided a formal model for the hypothesis of Biryukov et al. in practice, and this model is now much more practical  ...  Acknowledgements We thank Joo Yeon Cho for providing the linear approximations used in [10] .  ... 
doi:10.1007/978-3-642-14081-5_3 fatcat:gzbyd5v5bndrbgp5lhzpw3on3i

Parallel computation using active self-assembly [article]

Moya Chen, Doris Xin, Damien Woods
2014 arXiv   pre-print
Along the way, we give fast parallel nubot algorithms for a number of problems including line growth, sorting, Boolean matrix multiplication and space-bounded Turing machine simulation, all using a constant  ...  We show that the nubot model is capable of simulating Boolean circuits of polylogarithmic depth and polynomial size, in only polylogarithmic expected time.  ...  We thank Erik Winfree for valuable discussion and suggestions on our results, Paul Rothemund for stimulating conversations on molecular muscle, Niall Murphy for informative discussions on circuit complexity  ... 
arXiv:1405.0527v2 fatcat:a5zidklkezacheb4qomqeqj6py

Boolean minimizer FC-min: coverage finding process

P. Fiser, H. Kubatova
2004 Euromicro Symposium on Digital System Design, 2004. DSD 2004.  
The problem of Boolean minimization is approached in a reverse way than common minimizers do.  ...  Thus, only the necessary group implicants are being generated, which makes FC-Min an extremely fast and efficient minimizer for functions with many output variables.  ...  Acknowledgement This research was supported by a grant GA 102/04/2137 and MSM 212300014  ... 
doi:10.1109/dsd.2004.1333271 dblp:conf/dsd/FiserK04 fatcat:4ihtkqxzdrbyfgdoemisiz4kju

Higher-order masked Saber [article]

Suparna Kundu, Jan-Pieter D'Anvers, Michiel Van Beirendonck, Angshuman Karmakar, Ingrid Verbauwhede
2022 IACR Cryptology ePrint Archive  
We provide a detailed analysis of different masking algorithms proposed for Saber in the recent past and propose an optimized implementation of higher-order masked Saber.  ...  In this work, we present a detailed study of higher-order masking techniques for the key-encapsulation mechanism Saber.  ...  [11] introduced a new method based on A2B conversion for the masked comparison algorithm for Kyber, in order to reduce the cost of the Boolean equality check circuit.  ... 
dblp:journals/iacr/KunduDBKV22 fatcat:osttinpogndrbdywgi2zjzehbm

An Intelligent Learning System based on Random Search Algorithm and Optimized Random Forest Model for Improved Heart Disease Detection

Ashir Javeed, Shijie Zhou, Liao Yongjian, Iqbal Qasim, Adeeb Noor, Redhwan Nour, Samad Wali, Abdul Basit
2019 IEEE Access  
The proposed diagnostic system uses random search algorithm (RSA) for features selection and random forest model for heart failure prediction.  ...  The diagnosis of heart failure is a challenging task especially in under-developed and developing countries where there is a paucity of human experts and equipments.  ...  In the first iteration, the RSA generates a boolean mask vector (random boolean mask) with only one True value (at a location randomly generated).  ... 
doi:10.1109/access.2019.2952107 fatcat:vfg4hipxzrewpmqbr2f4trallm

A Parallel Bit Map Processor Architecture for DA Algorithms

T. Blank, M. Stefik, W. vanCleemput
1981 18th Design Automation Conference  
A bit map has been identified as a commonly used data structure for representing physical structnrcs (i.e. PCB or IC masks).  ...  Unfortunately, the speed of large mainframes is not increasing as fast as the increase in problem size and commensurate non-linear increase in execution time.  ...  Unfortunately, the speed of large mainframes is not increasing as fast as the increase in problem size and commensurate non-linear increase in execution time.  ... 
doi:10.1109/dac.1981.1585453 fatcat:qrr5s7s64nhwlpmzvpaonb7pym
« Previous Showing results 1 — 15 out of 6,787 results