Speech Encryption and Decryption Using Linear Feedback Shift Register (LFSR)

Authors: Tin Lai Win, Nant Christina Kyaw

Abstract:

This paper is taken into consideration the problem of cryptanalysis of stream ciphers. There is some attempts need to improve the existing attacks on stream cipher and to make an attempt to distinguish the portions of cipher text obtained by the encryption of plain text in which some parts of the text are random and the rest are non-random. This paper presents a tutorial introduction to symmetric cryptography. The basic information theoretic and computational properties of classic and modern cryptographic systems are presented, followed by an examination of the application of cryptography to the security of VoIP system in computer networks using LFSR algorithm. The implementation program will be developed Java 2. LFSR algorithm is appropriate for the encryption and decryption of online streaming data, e.g. VoIP (voice chatting over IP). This paper is implemented the encryption module of speech signals to cipher text and decryption module of cipher text to speech signals.

Keywords: Linear Feedback Shift Register.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1062536

References:

[1] Dao Q. Van, Anne Weiz and Benot Geller, Improving End to End Latency for Voice over IPSec Streams.
[2] D. Minoli and E. Minoli, Delivering Voice over IP Networks, New York: John Wiley & Sons, 1998.
[3] D. Richard Kuhn, Thomas J. Walsh, Steffen Fries, Security Considerations for voice Over IP Systems.
[4] P. Alfke, "Efficient Shift Registers, LFSR Counters, and Long Pseudo- Random Sequence Generators," Xilinx, Tech. Rep., 1996, (10) Qiu- Hua Lin, Fu-Liang Yin, Tie-Min Mei, and Hualou Liang, A Blind Source Separation Based Method for Speech Encryption.