Fuzzy logic based Truly Random number generator for high-speed BIST applications

Kumar, G. Sathesh; Saminadan, V.

doi:10.1016/j.micpro.2019.04.002

Cited by 1 publication

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some of the recent developments in field of random and pseudo-random number generators have been reviewed. For example, the random number generation in [26,27] show the applications in BIST and IoT Applications. The later one is based on chaos and is validated by statistical tests.…”

Section: Related Workmentioning

confidence: 99%

“…We chose some recent works from the literature for comparing the results and to validate the randomness efficiency of SRFG. The algorithms described in [26,27,29,[31][32][33] exhibit true randomness and therefore have been considered for the comparison with SRFG. Another recent algorithm depicted in [18] is also considered for comparison due to its related features.…”

Section: Comparative Analysismentioning

confidence: 99%

See 1 more Smart Citation

A Secure Random Number Generator with Immunity and Propagation Characteristics for Cryptography Functions

et al. 2021

View full text Add to dashboard Cite

Cryptographic algorithms and functions should possess some of the important functional requirements such as: non-linearity, resiliency, propagation and immunity. Several previous studies were executed to analyze these characteristics of the cryptographic functions specifically for Boolean and symmetric functions. Randomness is a requirement in present cryptographic algorithms and therefore, Symmetric Random Function Generator (SRFG) has been developed. In this paper, we have analysed SRFG based on propagation feature and immunity. Moreover, NIST recommended statistical suite has been tested on SRFG outputs. The test values show that SRFG possess some of the useful randomness properties for cryptographic applications such as individual frequency in a sequence and block-based frequency, long run of sequences, oscillations from 0 to 1 or vice-versa, patterns of bits, gap bits between two patterns, and overlapping block bits. We also analyze the comparison of SRFG and some existing random number generators. We observe that SRFG is efficient for cryptographic operations in terms of propagation and immunity features.

show abstract

Section: Related Workmentioning

confidence: 99%