On a High-Speed Parallel-LM Binary Sequcence Generator


The KIPS Transactions:PartC, Vol. 10, No. 7, pp. 851-856, Dec. 2003
10.3745/KIPSTC.2003.10.7.851,   PDF Download:

Abstract

The LM generator is an improved summation generator with maximum period, near maximum linear complexity and maximum order of correlation immunity, and it has a property with the input-output correlation immunity. In this paper, we propose the high-speed m-parallel LM-BSG and 8-parallel LM-BSG for detail as a design example. When compared with a conventional stream cipher, the properties of the proposed cipher exhibited the same crypto-degree (security) with a times faster processing.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
L. H. Jae, "On a High-Speed Parallel-LM Binary Sequcence Generator," The KIPS Transactions:PartC, vol. 10, no. 7, pp. 851-856, 2003. DOI: 10.3745/KIPSTC.2003.10.7.851.

[ACM Style]
Lee Hun Jae. 2003. On a High-Speed Parallel-LM Binary Sequcence Generator. The KIPS Transactions:PartC, 10, 7, (2003), 851-856. DOI: 10.3745/KIPSTC.2003.10.7.851.