Chapter

Cryptography and Security: From Theory to Applications

Volume 6805 of the series Lecture Notes in Computer Science pp 355-363

Cryptography with Asynchronous Logic Automata

  • Peter Schmidt-NielsenAffiliated withMIT Center for Bits and Atoms
  • , Kailiang ChenAffiliated withMIT Center for Bits and Atoms
  • , Jonathan BachrachAffiliated withMIT Center for Bits and Atoms
  • , Scott GreenwaldAffiliated withMIT Center for Bits and Atoms
  • , Forrest GreenAffiliated withMIT Center for Bits and Atoms
  • , Neil GershenfeldAffiliated withMIT Center for Bits and Atoms

* Final gross prices may vary according to local VAT.

Get Access

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.

Keywords

asynchronous cellular cryptography stream cipher power balance