Cryptography with asynchronous logic automata

Authors:
Peter Schmidt-Nielsen;Kailiang Chen;Jonathan Bachrach;Scott Greenwald;Forrest Green;Neil Gershenfeld
Affiliations:
MIT Center for Bits and Atoms, Cambridge, MA;MIT Center for Bits and Atoms, Cambridge, MA;MIT Center for Bits and Atoms, Cambridge, MA;MIT Center for Bits and Atoms, Cambridge, MA;MIT Center for Bits and Atoms, Cambridge, MA;MIT Center for Bits and Atoms, Cambridge, MA
Venue:
Cryptography and Security
Year:
2012

Citing 7
Cited 0

Cryptography with cellular automata

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Theory and Applications of Cellular Automata in Cryptography

IEEE Transactions on Computers
Improving Smart Card Security Using Self-Timed Circuits

ASYNC '02 Proceedings of the 8th International Symposium on Asynchronus Circuits and Systems
A Self-Timed Arithmetic Unit for Elliptic Curve Cryptography

DSD '02 Proceedings of the Euromicro Symposium on Digital Systems Design
Cellular automata computations and secret key cryptography

Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
Fast elliptic curve cryptography on FPGA

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Reconfigurable asynchronous logic automata: (RALA)

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

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.