Yet Another Pseudorandom Number Generator

Stoyanov, B.; Szczypiorski, Krzysztof; Kordov, Krasimir

doi:10.1515/eletel-2017-0026

Cited by 10 publications

(3 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [6,14,17,20,21,[28][29][30][31], and [36], a number of generation schemes and program tools based on chaotic attractors and shift registers, are proposed. They can be successfully integrated in social networks [19] and [37].…”

Section: Introductionmentioning

confidence: 99%

BentSign: keyed hash algorithm based on bent Boolean function and chaotic attractor

Todorova,

Stoyanov,

Szczypiorski

et al. 2019

View full text Add to dashboard Cite

In this study, we propose a novel keyed hash algorithm based on a Boolean function and chaotic attractor. The hash algorithm called BentSign is based on two Signature attractors and XOR function and a bent Boolean function. The provided theoretical and experimental results confirm that the novel scheme can generate output hashes with a good level of security, collision resistance, and protection against most common attacks.

show abstract

Section: Introductionmentioning

confidence: 99%

BentSign: keyed hash algorithm based on bent Boolean function and chaotic attractor

Todorova,

Stoyanov,

Szczypiorski

et al. 2019

View full text Add to dashboard Cite

show abstract

“…Pseudo-random sequences constructed from the solutions of two Chebyshev maps, filtered by threshold function are presented in [24]. In [8], [13], [14], [16], [23], [25], [26], and [27] new pseudo-random bit generators and software applications based on discrete chaotic maps, are designed.…”

Section: Introductionmentioning

confidence: 99%

SHAH: Hash Function based on Irregularly Decimated Chaotic Map

Todorova,

Stoyanov,

Szczypiorski

et al. 2018

Preprint

Self Cite

View full text Add to dashboard Cite

In this paper, we propose a novel hash function based on irregularly decimated chaotic map. The hash function called SHAH is based on two Tinkerbell maps filtered with irregular decimation rule. Exact study has been provided on the novel scheme using distribution analysis, sensitivity analysis, static analysis of diffusion and confusion, and collision analysis. The experimental data show that SHAH satisfied admirable level of security.

show abstract

“…Pseudo-random sequences constructed from two Chebyshev maps, filtered by decimation function are presented in [25]. In [4], [9], [14], [15], [17], [24], [26]- [28] new pseudo-random bit generation techniques, software applications based on chaotic maps, and studies about sets are presented.…”

Section: Introductionmentioning

confidence: 99%

International Journal of Electronics and Telecommunications

Todorova¹,

Stoyanov²,

Szczypiorski³

et al. 2018

View full text Add to dashboard Cite

We present a new hash function based on irregularly decimated chaotic map, in this article. The hash algorithm called SHAH is based on two Tinkerbell maps filtered with irregular decimation rule. We evaluated the novel function using distribution analysis, sensitivity analysis, static analysis of diffusion, static analysis of confusion, and collision analysis. The experimental data show that SHAH satisfied valuable level of computer security.

show abstract

Yet Another Pseudorandom Number Generator

Cited by 10 publications

References 28 publications

BentSign: keyed hash algorithm based on bent Boolean function and chaotic attractor

BentSign: keyed hash algorithm based on bent Boolean function and chaotic attractor

SHAH: Hash Function based on Irregularly Decimated Chaotic Map

International Journal of Electronics and Telecommunications

Contact Info

Product

Resources

About