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.
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.
Similar content being viewed by others
References
Banks, J., Carson, J.S., Nelson, B.L., Nicol, D.M.: Discrete-Event System Simulation, 5th edn. Prentice Hall (2010)
Bao, F., Igarashi, Y.: Break Finite Automata Public Key Cryptosystems. In: Fülöp, Z. (ed.) ICALP 1995. LNCS, vol. 944, pp. 147–158. Springer, Heidelberg (1995)
Bao, F., Igarashi, Y., Yu, X.: Some results on decomposition of weakly invertible finite automata. IEICE Transactions on Information and Systems E79-D, 1–7 (1996)
Cramer, T., Friedman, R., Miller, T., Seberger, D., Wilson, R., Wolczko, M.: Compiling java just in time. IEEE Micro 17 (1997)
Dai, D.W., Wu, K., Zhang, H.G.: Cryptanalysis on a finite automaton public key cryptosystem. Science in China, Ser. A 39, 27–36 (1996)
Dai, Z.-D., Ye, D.F., Lam, K.-Y.: Weak Invertibility of Finite Automata and Cryptanalysis on FAPKC. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 227–241. Springer, Heidelberg (1998)
Ehrsam, W.F., Meyer, C.H.W., Smith, J.L., Tuchman, W.L.: Message verification and transmission error detection by block chaining. US Patent 4074066 (1976)
Goldwasser, S., Micali, S.: Probabilistic encryption and how to play mental poker keeping secret all partial information. In: Annual ACM Symposium on Theory of Computing (1982)
Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman and Hall, CRC (August 2007)
Mathews, J.H.: Monte carlo estimate for pi. Pi Mu Epsilon Journal 5, 281–282 (1972)
Meskanen, T.: On finite automaton public key cryptosystems. Technical Report 408, TUCS - Turku Centre for Computer Science, Turku, Finland (2001)
U.S. Department of Commerce National Bureau of Standards. Data encryption standard. Federal Information Processing Standard (FIPS), Publication 46 (1977)
Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal 27, 379–423 (1948)
Hermetic Systems. Testing the me6 cryptosystem, http://www.hermetic.ch (accessed in December 2011)
Tao, R.J.: Finite Automata and Application to Cryptography. Tsinghua University Press (January 2008)
Tao, R.J., Chen, S.H.: A finite automaton public-key cryptosystem and digital signatures. Chinese Journal of Computers 8, 401–409 (1985) (in Chinese)
Tao, R.J., Chen, S.H.: Two varieties of finite automaton public key cryptosystem and digital signatures. Journal of Computer Science and Technology 1, 9–18 (1986)
Tao, R.J., Chen, S.H.: A variant of the public key cryptosystem fapkc3. Journal of Network and Computer Applications 20, 283–303 (1997)
Tao, R.J., Chen, S.H., Chen, X.M.: Fapkc3: A new finite automaton public key cryptosystem. Journal of Computer Science and Technology 12(4), 289–304 (1997)
Walker, J.: Fourmilab ent - a pseudorandom number sequence test program, http://www.fourmilab.ch/random (accessed in December 2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Abubaker, S., Wu, K. (2013). DAFA - A Lightweight DES Augmented Finite Automaton Cryptosystem. In: Keromytis, A.D., Di Pietro, R. (eds) Security and Privacy in Communication Networks. SecureComm 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36883-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-36883-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36882-0
Online ISBN: 978-3-642-36883-7
eBook Packages: Computer ScienceComputer Science (R0)