Abstract
Cryptography is an important and vital application in security, defence, medical, business and many other application areas. The effective measure of a cryptosystem, is how long it can be used to encrypt and decrypt messages without the ‘key’ being broken. A class of cellular automata (CA) based encryption algorithms presents a particular promising approach to cryptography, since the initial state of the CA is the key to the encryption, evolving a complex chaotic system from this ‘initial state’ which cannot be predicted. However, software implementations of CA cryptography have the disadvantage that special purpose hardware canbe applied to break the code. Thus implementation in hardware is desirable to ensure that this evolutionary approach to computing is done in real time. This short paper has demonstrated CA cryptography can be implemented on a reconfigurable computing architecture (SPACE-2). The algorithm was described and verified in the Circal process algebra, and demonstrated on the reconfigurable computer.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Diffie W., M. Hellman “New Directions in Cryptography,” IEEE Transactions on Information Theory (1976).
Guan P., “Cellular Automaton Public-Key Cryptosystems,” Complex Systems Vol. 1, 1987.
Von Neumann J., “Theory of Self-Reproducing Automata,” edited and completed by A.W. Burks, Urbana, IL: University of Illinois Press, 1966.
Burks A. W., “Essays on Cellular Automata. Urbana,” University of Illinois Press, 1970.
Wolfram S. “Cellular Automata as models of complexity,” Nature Vol 311, pp 419–424 October 1984.
Preston K, M. Duff, “Modern Cellular Automata: Theory and Applications,” Plenum Press, New York, 1985.
Buell D., J. Arnold, W. Kleinfelder editors, “Splash 2: FPGAs in a Custom Computing Machine,” IEEE Computer Society Press, May 1996.
Cockshott P, P. Shaw, P. Barrie, G. Milne “Scalable cellular array architecture,” IEE Computing & Control Engineering Journal, vol 3, no5, September 1992
Milne G., P. Cockshott, G. McCaskill, P. Barrie. “Realising massively concurrent systems on the SPACE machine,” in Proc IEEE Workshop on FPGAs for Custom Computing Machines, pp. 26–32, 1993 and University of Strathclyde Research Report HDV-29-93.
Milne G., P. Shaw. “A highly parrallel FPGA-based machine and its formal verification,” Lecture Notes in Computer Science, No705. Springer-Verlag 1993.
Margolus N, M. Toffoli, “STEP: A space time event processor. Software Reference,” MIT Laboratory for Computer Science, Cambridge, MA 02139, 1995.
Eckart JD “Cellang: Language Reference Manual,” Radford University, Radford, VA, April 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
George, D.F.J., George, S.E. (2003). Cellular Automata Cryptography Using Reconfigurable Computing. In: Chung, P.W.H., Hinde, C., Ali, M. (eds) Developments in Applied Artificial Intelligence. IEA/AIE 2003. Lecture Notes in Computer Science(), vol 2718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45034-3_11
Download citation
DOI: https://doi.org/10.1007/3-540-45034-3_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40455-2
Online ISBN: 978-3-540-45034-4
eBook Packages: Springer Book Archive