Research Article
DAFA - A Lightweight DES Augmented Finite Automaton Cryptosystem
@INPROCEEDINGS{10.1007/978-3-642-36883-7_1, author={Sarshad Abubaker and Kui Wu}, title={DAFA - A Lightweight DES Augmented Finite Automaton Cryptosystem}, proceedings={Security and Privacy in Communication Networks. 8th International ICST Conference, SecureComm 2012, Padua, Italy, September 3-5, 2012. Revised Selected Papers}, proceedings_a={SECURECOMM}, year={2013}, month={2}, keywords={Cryptography Finite Automata Symmetric key Probabilistic encryption}, doi={10.1007/978-3-642-36883-7_1} }- Sarshad Abubaker
Kui Wu
Year: 2013
DAFA - A Lightweight DES Augmented Finite Automaton Cryptosystem
SECURECOMM
Springer
DOI: 10.1007/978-3-642-36883-7_1
Abstract
Unlike most cryptosystems which rely on number theoretic problems, cryptosystems based on the invertibility of finite automata are lightweight in nature and can be implemented easily using simple logical operations, thus affording fast encryption and decryption. In this paper, we propose and implement a new variant of finite automaton cryptosystem, which we call DES-Augmented Finite Automaton (DAFA) cryptosystem. DAFA uses the key generation algorithm of the Data Encryption Standard (DES) to dynamically generate linear and non-linear finite automata on the fly using a 128-bit key. Compared to existing finite automaton cryptosystems, DAFA provides stronger security yet has similar encryption/decryption speeds. DAFA is also faster than popular single key cryptosystems such as Advanced Encryption Standard (AES). The test results on desktop and mobile phones with respect to the running speed and security properties are very promising.
