Abstract
We introduce the use of asynchronous logic automata (ALA) for cryptography. ALA aligns the descriptions of hardware and software for portability, programmability, and scalability. An implementation of the A5/1 stream cipher is provided as a design example in a concise hardware description language, Snap, and we discuss a power- and timing-balanced cell design.
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
Delsarte, P., Quisquater, J.J.: Permutation cascades with normalized cells. Information and Control 23, 344–356 (1973)
Wolfram, S.: Cryptography with cellular automata. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 429–432. Springer, Heidelberg (1986)
Nandi, S., Kar, B.K., Chaudhuri, P.P.: Theory and applications of cellular automata in cryptography. IEEE Transactions on Computers 43, 1346–1357 (1994)
Seredynski, F., Bouvry, P., Zomaya, A.Y.: Cellular automata computations and secret key cryptography. Parallel Computing 30, 753–766 (2004)
Das, D., Ray, A.: A parallel encryption algorithm for block ciphers based on reversible programmable cellular automata. Journal of Computer Science and Engineering 1, 82–90 (2010)
Chelton, W.N., Benaissa, M.: Fast elliptic curve cryptography on FPGA. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 16, 198–205 (2008)
Moore, S., Anderson, R., Cunningham, P., Mullins, R., Taylor, G.: Improving smart card security using self-timed circuits. In: Proceedings of the Eighth International Symposium on Asynchronous Circuits and Systems (ASYNC 2002), p. 211 (2002)
Feldhofer, M., Trathnigg, T., Schnitzer, B.: A self-timed arithmetic unit for elliptic curve cryptography. In: Proceedings of the Euromicro Symposium on Digital System Design (DSD 2002), p. 347 (2002)
Gershenfeld, N., Dalrymple, D., Chen, K., Knaian, A., Green, F., Demaine, E.D., Greenwald, S., Schmidt-Nielsen, P.: Reconfigurable asynchronous logic automata (RALA). In: Proceedings of the 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, pp. 1–6. ACM, New York (2010)
Bachrach, J., Greenwald, S., Schmidt-Nielsen, P., Gershenfeld, N.: Spatial programing of asynchronous logic automata (2011) (manuscript)
Chen, K., Green, F., Gershenfeld, N.: Asynchronous logic automata ASIC design (2011) (manuscript)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schmidt-Nielsen, P., Chen, K., Bachrach, J., Greenwald, S., Green, F., Gershenfeld, N. (2012). Cryptography with Asynchronous Logic Automata. In: Naccache, D. (eds) Cryptography and Security: From Theory to Applications. Lecture Notes in Computer Science, vol 6805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28368-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-28368-0_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28367-3
Online ISBN: 978-3-642-28368-0
eBook Packages: Computer ScienceComputer Science (R0)