About a Fast Cryptographic Hash Function Using Cellular Automata Ruled by Far-Off Neighbours
 |
International Journal of Engineering Trends and Technology (IJETT) |  |
| © 2021 by IJETT Journal | ||
| Volume-69 Issue-2 |
||
| Year of Publication : 2021 | ||
| Authors : Vincent Manuceau |
||
| DOI : 10.14445/22315381/IJETT-V69I2P206 |
Citation
MLA Style: Vincent Manuceau "About a Fast Cryptographic Hash Function Using Cellular Automata Ruled by Far-Off Neighbours" International Journal of Engineering Trends and Technology 69.2(2021):39-41.
APA Style:Vincent Manuceau. About a Fast Cryptographic Hash Function Using Cellular Automata Ruled by Far-Off Neighbours. International Journal of Engineering Trends and Technology, 69(2),39-41.
Abstract
This paper describes a 256 bits output cryptographic hashing algorithm based upon a specific kind of 2D cellular automata, adapted from Conway’s Game of Life, where each cell is ruled by its far-off neighbors. The notion of Moore’s far neighborhood of a cell on a 2D circular grid is defined, and more specifically, a far neighborhood of 8 cells is exploited to drive the cellular automaton. The obtained hash function is lightweight and fast by design, with a nice avalanche effect; it can be used as an effective and sustainable algorithm for Proof-of-Work blockchains, IoT, and many other applications.
Reference
[1] J. Andress, The Basics of Information Security: Understanding the Fundamentals of InfoSec in Theory and Practice, 2nd ed., Syngress Publishing, (2014) ISBN 9780128008126.
[2] H. F. Atlamab and G. B. Willsa, Role of Blockchain Technology in IoT Applications. Advances in Computers, 115(2019) 1-39 Elsevier, doi : https://doi.org/10.1016/bs.adcom.2018.10.006.
[3] P.-E. Black, Manhattan distance in Dictionary of Algorithms and Data Structures, NIST, (2019), [Online], Available: https://www.nist.gov/dads/HTML/manhattanDistance.html.
[4] D. E. Knuth, The Art of Computer Programming: 3: Sorting and Searching, 115, Pearson Education, 527(1998) ISBN 9780321635785.
[5] J.-P. Rennard, Vie artificielle: Ou la biologie rencontre l`informatique, 1st ed., Paris, France: Vuibert Informatique, (2002) 63-82, ISBN 9782711786947.
[6] J. L. Schiff, Cellular Automata: A Discrete View of the World, Wiley, (2011) 70-80, ISBN 9781118030639.
[7] T. Toffoli and N. Margolus, Cellular Automata Machines: A New Environment for Modeling, Cambridge, MA, USA: MIT Press, (1987), ch. 7, ISBN 0262200600.
[8] A. F. Webster and S. E. Tavares, On the Design of S-Boxes, Lecture Notes in Computer Sciences; 218 on Advances in Cryptology, Santa Barbara, California, USA: Springer-Verlag, (1986) 523–534, ISBN 0387164634.
[9] S. Wolfram, A New Kind of Science, Wolfram Media, (2002) 231-249, ISBN 9781579550080.
[10] N Bhushana Babu D, E V Krishna Rao, K.S.N.Murthy Inter-Gateway Handoff Management Using Ant Colony Optimization (ACO) for Wireless Mesh Networks, International Journal of Engineering Trends and Technology 68(11) (2020) 63-71.
Keywords
Cryptography, Hash function, Cellular automata, Moore’s far neighborhood.