Authenticated Encryption Based on Finite Automata Cryptosystems

被引：0

作者：

Salas Pena, Pedro Ivan ^{[1
]}

Gonzalez Torres, Raul Ernesto ^{[1
]}

机构：

[1] CINVESTAV Guadalajara, Comp Sci, Zapopan, Jalisco, Mexico

来源：

2016 13TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING, COMPUTING SCIENCE AND AUTOMATIC CONTROL (CCE) | 2016年

关键词：

Authenticated Encryption; Cryptography with Finite Automata; FASKC; MAC; Cryptographic Boolean Functions;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We present a new Authenticated Encryption (AE) scheme based on finite automata using the method Encrypt-then-MAC. The scheme is constructed from two cryptographic primitives, a symmetric encryption scheme based on finite automata known as FASKC and a Message Authentication Code (MAC) constructed from a finite automaton. The paper shows how the scheme works and how to construct a MAC from a finite automaton using a boolean function with good cryptographic properties. Due to the construction method and the assumption that the symmetric encryption scheme is secure under Chosen Plaintext Attack (CPA), it is shown that the MAC is unforgeable under Chosen Message Attack (UF-CMA) making the scheme secure under Chosen Ciphertext Attack (CCA).

引用

页数：6

共 13 条

[1] Bellare M, 2004, LECT NOTES COMPUT SC, V3017, P389
[2] Bellare M, 2000, LECT NOTES COMPUT SC, V1976, P531
[3] Bellare Mihir., 1996, Keying hash functions for message authentication, P1
[4] Hawkes P., 2007, PRIMITIVE SPECIFICAT
[5] McGrew DA, 2004, LECT NOTES COMPUT SC, V3348, P343
[6] Nunez Chavez W. E., 2014, THESIS
[7] O'Neil S., 2005, IACR Cryptology ePrint Archive, V2005, P413
[8] Preneel B., 1998, CRYPTANALYSIS MESSAG, P55
[9] Rogaway P., 2003, ACM Transactions on Information and Systems Security, V6, P365, DOI 10.1145/937527.937529
[10] Construction of balanced Boolean functions with high nonlinearity and good autocorrelation properties
Tang, Deng
Zhang, Weiguo
Tang, Xiaohu
[J]. DESIGNS CODES AND CRYPTOGRAPHY, 2013, 67 (01) : 77 - 91

← 1 2 →