Unpredictable 16 bits LFSR-based true random number generator

Han, Mangi; Kim, Young‐Min

doi:10.1109/isocc.2017.8368897

Cited by 16 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The research community has considered LFSRs as promising choices for random number generation and cryptographic purposes because of their low area and power consumption as well as their high throughput [ 40 , 41 ]. They have been widely used for both pseudo-random [ 42 ] and true-random number [ 43 , 44 ] generation. Different variants of LFSRs have been used for this purpose [ 22 , 45 , 46 ].…”

Section: Background and Related Workmentioning

confidence: 99%

From Random Numbers to Random Objects

Zolfaghari

Bibak

Koshiba

2022

Entropy

View full text Add to dashboard Cite

Many security-related scenarios including cryptography depend on the random generation of passwords, permutations, Latin squares, CAPTCHAs and other types of non-numerical entities. Random generation of each entity type is a different problem with different solutions. This study is an attempt at a unified solution for all of the mentioned problems. This paper is the first of its kind to pose, formulate, analyze and solve the problem of random object generation as the general problem of generating random non-numerical entities. We examine solving the problem via connecting it to the well-studied random number generation problem. To this end, we highlight the challenges and propose solutions for each of them. We explain our method using a case study; random Latin square generation.

show abstract

Section: Background and Related Workmentioning

confidence: 99%

From Random Numbers to Random Objects

Zolfaghari

Bibak

Koshiba

2022

Entropy

View full text Add to dashboard Cite

show abstract

“…"Mangi Han and Youngmin Kim 2017" [7] shown in their work non predicted 16 bits LFSR to form True Random Number Generator that an anticipated randomize number produced by the are deadly to applications.…”

Section: "Vishal V Panchbhai and Mohini Mohurle 2016" [6] In Their Wmentioning

confidence: 99%

Double Security using Dynamic S-Box inside Aes Algorithm

Dwivedi,

Khan,

Sinha

2019

IJEAT

View full text Add to dashboard Cite

Now a days internet and other electronic devices have become an non removable part of our society. Day by day we are increasing the usage of data for transmission and storage as well. But there is always a problem for our data to be in wrong hands or hacked by someone. In order to ensure our secrecy of data we use bunch of algorithms to secure it. These algorithms comes under the vast section of cryptology, which means an art of hiding the data to make it secure. But as we all know when there is a hacker he would find every possible way to bypass the security algorithms. Some of the attacks are very popular in cryptology like Brute Force Attacks which checks each possible key combination to hack the data message. Due to the arrival of quantum computers in upcoming future hacking time will be decreased about a factor of around 1000 times. Now the best possible solution for enciphering data is Advanced Encryption Standard .This algorithm consists of two basic things static Substitution Box (S-Box) and other register operation. In this paper we have introduced a new technique to ensure a secure communication by using a dynamic S-Box with avalanche value of 58.59% as well as we also improved the overall area, delay (1.227 ns) and optimized the power to possible extents. Our results also approached above the traditional AES security as our modification improves avalanche effect also

show abstract

“…Meanwhile, the limitation of this method is a weakness of RC4(Jindal & Singh, 2015). Also, LFSR has two problems periodic and predictable(Han & Kim, 2017).Some characteristics of a chaotic system have significant importance for the image encryption methods (Abundiz-Pérez, et al, 2016): (i) a simple process able to generate complicated dynamics that produces a pseudorandom string where the secret data can be concealed. (ii) Small changes in the initial states of a chaotic system produces high variations in the output dynamic that can be used for increasing the number of encryption keys.…”

mentioning

confidence: 99%

An Efficient Method of Image Encryption Using Rossler Chaotic System

Hamza¹,

Omer

2021

ACAD J NAWROZ UNIV

View full text Add to dashboard Cite

In this study, a new approach of image encryption has been proposed. This method is depends on the symmetric encryption algorithm RC4 and Rossler chaotic system. Firstly, the encryption key is employed to ciphering a plain image using RC4 and obtains a ciphered-image. Then, the same key is used to generate the initial conditions of the Rossler system. The system parameters and the initial conditions are used as the inputs for Rossler chaotic system to generate the 2-dimensional array of random values. The resulted array is XORed with the ciphered-image to obtain the final encrypted-image. Based on the experimental results, the proposed method has achieved high security and less computation time. Also, the proposed method can be resisted attacks like (statistical, brute-force, and differential).

show abstract

Unpredictable 16 bits LFSR-based true random number generator

Cited by 16 publications

References 5 publications

From Random Numbers to Random Objects

From Random Numbers to Random Objects

Double Security using Dynamic S-Box inside Aes Algorithm

An Efficient Method of Image Encryption Using Rossler Chaotic System

Contact Info

Product

Resources

About