Restoring the initial states of LFSRs based on improved Viterbi algorithm (non-refereed)

Author

Luo, Xiangyang ; Luo, Junyong ; Liu, Fenlin ; Liu, Bin

Author_Institution

Inst. of Inf. Eng., Inf. & Eng. Univ., China

fYear

2005

fDate

8-10 April 2005

Firstpage

684

Abstract

Summary form only given. The linear feedback shift registers (LFSRs) are basic building blocks of many keystream generators in the fields of security communication and cipher, where the initial states of the LFSRs are often considered to be the secret key. An important restoring method is correlation attack based on the convolutional codes. The conventional Viterbi algorithm is designed to decode the convolutional code with a rate of k/n and a small constraint length, where k\n\n\t\t

Keywords

Hamming codes; Viterbi decoding; circuit feedback; convolutional codes; correlation methods; cryptography; shift registers; telecommunication security; Hamming distance table; LFSR initial state restoration; Viterbi algorithm; Viterbi algorithm storage structure; Viterbi decoding; cipher; constraint length; convolutional codes; correlation attack restoring method; decode rate; keystream generators; linear feedback shift registers; secret key; security communication; Algorithm design and analysis; Convolutional codes; Data structures; Decoding; Hamming distance; Information security; Linear feedback shift registers; Logic; Transmission line matrix methods; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

SoutheastCon, 2005. Proceedings. IEEE

Print_ISBN

0-7803-8865-8

Type

conf

DOI

10.1109/SECON.2005.1423326

Filename

1423326