Keyed hash function using Bernoulli shift map
by P. Jhansi Rani; S. Durga Bhavani
International Journal of Information and Computer Security (IJICS), Vol. 9, No. 3, 2017

Abstract: Chaos-based cryptography involves real number computations and hence produces slow algorithms. In order to address this issue, the existing approaches use piece-wise linear maps that speed up computations. High-dimensional linear maps have been chosen to avoid dynamical degradation. In this paper, we claim that a single one-dimensional nonlinear chaotic map can produce ergodic orbits in a fast manner. We propose a keyed hash function that takes advantage of the interplay between chaos-based dynamics and Bernoulli shift dynamics. The proposed Bernoulli keyed hash function proves to be an efficient scheme achieving speeds on par with the existing schemes in the literature. Extensive validation is carried out at byte, block and the whole message level for collision resistance and sensitivity to key analysis. We provide empirical analysis to show that the proposed scheme is preimage and second preimage resistant.

Online publication date: Thu, 13-Jul-2017

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 Information and Computer Security (IJICS):
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