Weak invertibility of finite automata and cryptanalysis on FAPKC

被引：0

作者：

Dai, ZD ^{[1
]}

Ye, DF

Lam, KY

机构：

[1] Acad Sinica, Grad Sch, Dept Math, State Key Lab Informat Secur, Beijing 10003908, Peoples R China

[2] Natl Univ Singapore, Dept Informat Syst & Comp Sci, Singapore 119260, Singapore

来源：

ADVANCES IN CRYPTOLOGY - ASIACRYPT'98 | 1998年 / 1514卷

关键词：

finite automaton; public key cryptosystem; cryptanalysis;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

FAPKC [17, 18, 19, 20, 22] is a public key cryptosystem based weakly invertible finite automata. Weak invertibility of FAs is the key to understand and analyze this scheme. In this paper a set of algebraic terminologies describing FAs is developed, and the theory of weak invertibility of FAs is studied. Based on this, a cryptanalysis on FAPKC is made. It is shown that the keys proposed in [17, 18, 19, 20, 21] for FAPKCs are insecure both in encrypting and in signing.

引用

页码：227 / 241

页数：15

共 25 条

[1] Bao F, 1995, LECT NOTES COMPUT SC, V944, P147
[2] DAI DW, 1994, CRYPTANALYSIS FINITE
[3] Dai ZD, 1996, SCI CHINA SER A, V39, P613
[4] DAI ZD, ADV CRYPTOLOGY CHINA, P127
[5] DAI ZD, 1995, KEXUE TONGBAO, V4, P1357
[6] CONVOLUTIONAL CODES .1. ALGEBRAIC STRUCTURE
FORNEY, GD
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1970, 16 (06) : 720 - +
[7] HEINO J, 1994, FINITE AUTOMATA LAYM
[8] HUFFMAN DA, 1959, CANONICAL FORMS IN S, P41
[9] JACOBSON N, BASIC ALGEBRA, V1, P175
[10] KYIMIT AA, 1974, INFORMATION LOSSLESS

← 1 2 3 →