Clock-controlled generators with large period output sequences
by Zhiqiang Lin
International Journal of Grid and Utility Computing (IJGUC), Vol. 5, No. 4, 2014

Abstract: Clock-controlled generators are a kind of pseudo-random number generators (PRNG). Recently, some clock-controlled generators based on jumping Linear Finite State Machines (LFSMs) have been proposed, such as Pomaranch and MICKEY. The period and the linear complexity of their output sequences need to be large enough to provide security against linear attacks. In this paper, a new condition for the period to reach its maximal value is presented. The condition is better than the previous one. Further, some clock-controlled generators are considered, including a new generator which uses a Feedback with Carry Shift Register (FCSR) as the control register. How to maximise the period of their output sequences is investigated.

Online publication date: Sat, 09-May-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com