The generalized shrinking-multiplexing generator

Authors:
Todor Tashev;Borislav Bedzhev;Zhaneta Tasheva
Affiliations:
University of Shumen, Shumen, Bulgaria;Air Defence and Communication-Information Systems, Shumen, Bulgaria;Air Defence and Communication-Information Systems, Shumen, Bulgaria
Venue:
CompSysTech '07 Proceedings of the 2007 international conference on Computer systems and technologies
Year:
2007

Citing 4
Cited 2

Analysis and design of stream ciphers

Analysis and design of stream ciphers
The shrinking generator

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Fibonacci and Galois representations of feedback-with-carry shift registers

IEEE Transactions on Information Theory

The period of the LFSR based generalized shrinking-multiplexing generator

CompSysTech '07 Proceedings of the 2007 international conference on Computer systems and technologies
About balance property of the p-ary generalized self-shrinking generator sequence

Proceedings of the 14th International Conference on Computer Systems and Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new construction of a cryptographic generator which produces a p-ary pseudo random sequence (PRS) is proposed in this paper. The special features of architecture, called Generalized Shrinking-Multiplexing Generator (GSMG), are analyzed. The new method transforming an output p-ary GSMG sequence into binary is investigated. Finally, it is proofed that the output GSMG binary sequence is balanced and it does not contain any subsequence of 2[log2(p-1)] consecutive 1s or 0s. The established GSMG properties show that the PRSs generated by GSMG are suitable for high-speed cryptographic applications in the stream ciphers.