DocumentCode
383311
Title
Cryptography by pseudo random number generator
Author
Borujeni, Shahram Etemadi
Author_Institution
Dept. of Comput. Eng., Univ. of Isfahan, Iran
Volume
1
fYear
2002
fDate
2002
Firstpage
244
Abstract
This paper describes an encryption system for analog signals based on permutation of samples. The scrambling algorithm is based on the permutation of the samples and provides highly secured scrambled signal by permuting a large number of those samples. The algorithm for generation the permutation matrices is explained. Important items to be considered in designing the system are discussed such as choice and construction of permutation matrices, and configuration of the practical scrambling system. C programming language was used for simulation. The results of simulation and tests shows that proposed scrambling achieve extremely high-level security. The method of choice and generation of permutation matrices, Tompkin-Paig algorithm and maximum length shift register are discussed. Simulations of different parts of the system, include scrambler, descrambler and generation of permutation matrices programs are provided. Miscellaneous methods of objective tests are described. Theoretical and simulation results of these tests are also provided.
Keywords
cryptography; random number generation; C programming language; Tompkin-Paig algorithm; analog signals; encryption system; high-level security; maximum length shift register; objective tests; permutation matrices; pseudo random number generator; scrambling algorithm; Computer languages; Cryptography; Helium; Information security; Privacy; Random number generation; Secure storage; Shift registers; Signal generators; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Systems, 2002. Proceedings. 2002 First International IEEE Symposium
Print_ISBN
0-7803-7134-8
Type
conf
DOI
10.1109/IS.2002.1044262
Filename
1044262
Link To Document