Name
Abstract | ||
|---|---|---|
With cryptographic investigations, the design of Boolean functions is a wide area. The Boolean functions play important role in the construction of a symmetric cryptosystem. In this paper the modified hill climbing method is considered. Using hill climbing techniques, the method allows modifying bent functions used to design balanced, highly non-linear Boolean functions with high algebraic degree and low autocorrelation. The experimental results of constructing the cryptographically strong Boolean functions are presented. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ITNG.2009.102 | IACR Cryptology ePrint Archive |
Keywords | Field | DocType |
boolean function,bent function,modified hill,important role,boolean functions,non-linear boolean function,modified hill climbing method,cryptographic investigation,low autocorrelation,high algebraic degree,cryptographically strong boolean function,block cipher,autocorrelation,construction industry,information technology,data mining,linear cryptanalysis,cryptography,artificial neural networks,correlation,probability density function,non linearity,block ciphers,hill climbing,genetics,simulated annealing,stream cipher,stream ciphers | Boolean function,Hill climbing,Algebraic number,Algebra,Block cipher,Computer science,Bent function,Theoretical computer science,Stream cipher,Artificial neural network,Circuit minimization for Boolean functions,Distributed computing | Journal |
Volume | ISBN | Citations |
2008 | 978-0-7695-3596-8 | 7 |
PageRank | References | Authors |
0.58 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuriy I. Izbenko | 1 | 7 | 0.58 |
| Vladislav Kovtun | 2 | 7 | 0.58 |
| Alexandr Kuznetsov | 3 | 7 | 8.69 |