Log in

Relevant bibliographies by topics / NIST test suite / Journal articles

To see the other types of publications on this topic, follow the link: NIST test suite.

Journal articles on the topic 'NIST test suite'

Author: Grafiati

Published: 5 June 2025

Last updated: 1 August 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'NIST test suite.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Zubkov, Andrei Mikhailovich, and Aleksandr Aleksandrovich Serov. "Testing the NIST Statistical Test Suite on artificial pseudorandom sequences." Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] 10, no. 2 (2019): 89–96. http://dx.doi.org/10.4213/mvk286.

Full text

Abstract:

Обсуждаются результаты экспериментов с известным пакетом статистических критериев NIST, предназначенным для проверки гипотезы о равновероятности и независимости элементов двоичных последовательностей. В частности, рассмотрены условия на параметры чередования отрезков двух линейных рекуррентных последовательностей, при которых полученная последовательность успешно проходит все тесты пакета NIST.

APA, Harvard, Vancouver, ISO, and other styles

2

Okada, Kiyoshiro, Katsuhiro Endo, Kenji Yasuoka, and Shuichi Kurabayashi. "Learned pseudo-random number generator: WGAN-GP for generating statistically robust random numbers." PLOS ONE 18, no. 6 (2023): e0287025. http://dx.doi.org/10.1371/journal.pone.0287025.

Full text

Abstract:

Pseudo-random number generators (PRNGs) are software algorithms generating a sequence of numbers approximating the properties of random numbers. They are critical components in many information systems that require unpredictable and nonarbitrary behaviors, such as parameter configuration in machine learning, gaming, cryptography, and simulation. A PRNG is commonly validated through a statistical test suite, such as NIST SP 800-22rev1a (NIST test suite), to evaluate its robustness and the randomness of the numbers. In this paper, we propose a Wasserstein distance-based generative adversarial ne

APA, Harvard, Vancouver, ISO, and other styles

3

Rahman, Gohar, and Chuah Chai Wen. "Omega Network Pseudorandom Key Generation Based on DNA Cryptography." Applied Sciences 12, no. 16 (2022): 8141. http://dx.doi.org/10.3390/app12168141.

Full text

Abstract:

Eliminating the risk of bugs and external decryption in cryptographic keys has always been a challenge for researchers. The current research is based on a new design that uses an Omega network-based pseudorandom DNA key generation method to produce cryptographic keys for symmetric key systems. The designed algorithm initially takes two random binary numbers as inputs to the Omega network design, generating an output of 256 symmetric keys. The Omega network uses the concept of the central dogma of molecular biology (DNA and RNA properties), including DNA replication (for DNA) and the transcript

APA, Harvard, Vancouver, ISO, and other styles

4

Zubkov, Andrei Mikhailovich, and Aleksandr Aleksandrovich Serov. "Experimental study of NIST Statistical Test Suite ability to detect long repetitions in binary sequences." Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] 14, no. 2 (2023): 137–45. http://dx.doi.org/10.4213/mvk443.

Full text

Abstract:

Представлены и обсуждаются результаты эмпирического тестирования возможности обнаружения длинных повторов в двоичных последовательностях набором статистических тестов NIST. Набор детерминированных двоичных последовательностей, которые не отклоняются пакетом NIST, искажается детерминированным образом. Для того чтобы повредить двоичную последовательность, выбирается несколько ее подстрок фиксированной длины и каждая подстрока дублируется в случайном месте последовательности. Длина повторяющихся подстрок была выбрана значительно большей типичной длины самой длинной повторяющейся подстроки. Если к

APA, Harvard, Vancouver, ISO, and other styles

5

HAMANO, K., and T. KANEKO. "Correction of Overlapping Template Matching Test Included in NIST Randomness Test Suite." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E90-A, no. 9 (2007): 1788–92. http://dx.doi.org/10.1093/ietfec/e90-a.9.1788.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Pikuza, M. O., and S. Yu Mikhnevich. "Testing a hardware random number generator using NIST statistical test suite." Doklady BGUIR 19, no. 4 (2021): 37–42. http://dx.doi.org/10.35596/1729-7648-2021-19-4-37-42.

Full text

Abstract:

Random number generators are required for the operation of cryptographic information protection systems. For а correct application of the generator in the field of information security, it is necessary that its output sequence to be indistinguishable from a uniformly distributed random sequence. To verify this, it is necessary to test the generator output sequence using various statistical test suites such as Dihard and NIST. The purpose of this work is to test a prototype hardware random number generator. The generator is built on the basis of the ND103L noise diode and has a random digital s

APA, Harvard, Vancouver, ISO, and other styles

7

Yamaguchi, Akihiro, Takaaki Seo, and Keisuke Yoshikawa. "On the pass rate of NIST statistical test suite for randomness." JSIAM Letters 2 (2010): 123–26. http://dx.doi.org/10.14495/jsiaml.2.123.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Almaraz Luengo, Elena, and Javier Román Villaizán. "Cryptographically Secured Pseudo-Random Number Generators: Analysis and Testing with NIST Statistical Test Suite." Mathematics 11, no. 23 (2023): 4812. http://dx.doi.org/10.3390/math11234812.

Full text

Abstract:

There are several areas of knowledge in which (pseudo-)random numbers are necessary, for example, in statistical–mathematical simulation or in cryptography and system security, among others. Depending on the area of application, it will be necessary that the sequences used meet certain requirements. In general, randomness and uniformity conditions are required in the generated sequences, which are checked with statistical tests, and conditions on sequence unpredictability if the application is in security. In the present work, a literature review on cryptographically secure pseudo-random numbe

APA, Harvard, Vancouver, ISO, and other styles

9

Ping, Ping, Feng Xu, and Zhi Jian Wang. "Generating High-Quality Random Numbers by Next Nearest-Neighbor Cellular Automata." Advanced Materials Research 765-767 (September 2013): 1200–1204. http://dx.doi.org/10.4028/www.scientific.net/amr.765-767.1200.

Full text

Abstract:

Cellular automaton (CA) has been widely investigated as random number generators (RNGs). However, the CA rule and the number of neighbors must be chosen carefully for good randomness. In Ref. [11], non-uniform CA with next nearest neighborhood was applied to generate a pseudo-random sequence. Considering that non-uniform CA has more complex implementation in hardware and needs lager memory to store different rules than uniform CA. In this paper, we propose new RNGs based on uniform CA with next nearest neighborhood. Time spacing technique and NIST statistical test suite are used to find optima

APA, Harvard, Vancouver, ISO, and other styles

10

Niemkova, Olena, and Mykhailo Kikh. "COMPARATIVE STUDY OF TESTS FOR ASSESSMENT OF STATISTICAL CHARACTERISTICS OF RANDOM AND PSEUDO-RANDOM SEQUENCE GENERATORS." Cybersecurity: Education, Science, Technique 4, no. 24 (2024): 115–32. http://dx.doi.org/10.28925/2663-4023.2024.24.115132.

Full text

Abstract:

In the world of information security, computer science and cryptography, the issue of statistical security of generated sequences is very important. Statistical sequence security plays an important role in the following fields: cryptography, computer security, system modeling, statistical analysis, and information security in networks. This article is devoted to the study and comparison of test sets for evaluating the statistical properties of random and pseudorandom sequence generators. The comparison focuses on well-known test suites such as NIST, DieHard, and TestU01. These tests were selec

APA, Harvard, Vancouver, ISO, and other styles

11

SULAK, Fatih, Muhiddin UĞUZ, Onur KOÇAK, and Ali DOĞANAKSOY. "On the independence of statistical randomness tests included in the NIST test suite." TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES 25 (2017): 3673–83. http://dx.doi.org/10.3906/elk-1605-212.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Branning, David, and Matthew Bermudez. "Testing quantum randomness in single-photon polarization measurements with the NIST test suite." Journal of the Optical Society of America B 27, no. 8 (2010): 1594. http://dx.doi.org/10.1364/josab.27.001594.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Yerukala, Nagendar, V. Kamakshi Prasad, and Allam Apparao. "Performance and Statistical Analysis of Stream ciphers in GSM Communications." Journal of communications software and systems 16, no. 1 (2020): 11–18. http://dx.doi.org/10.24138/jcomss.v16i1.892.

Full text

Abstract:

For a stream cipher to be secure, the keystream generated by it should be uniformly random with parameter 1/2.Statistical tests check whether the given sequence follow a certain probability distribution. In this paper, we perform a detailed statistical analysis of various stream ciphers used in GSM 2G,3G, 4G and 5G communications. The sequences output by these ciphers are checked for randomness using the statistical tests defined by the NIST Test Suite. It should also be not possible to derive any information about secret key and the initial state ofthe cipher from the keystream. Therefore, ad

APA, Harvard, Vancouver, ISO, and other styles

14

PARESCHI, FABIO, GIANLUCA SETTI, and RICCARDO ROVATTI. "STATISTICAL TESTING OF A CHAOS BASED CMOS TRUE-RANDOM NUMBER GENERATOR." Journal of Circuits, Systems and Computers 19, no. 04 (2010): 897–910. http://dx.doi.org/10.1142/s0218126610006517.

Full text

Abstract:

As faster Random Number Generators become available, the possibility to improve the accuracy of randomness tests through the analysis of a larger number of generated bits increases. In this paper we first introduce a high-performance true-random number generator designed by authors, which use a set of discrete-time piecewise-linear chaotic maps as its entropy source. Then, we present by means of suitably improved randomness tests, the validation of this generator and the comparison with other high-end solutions. We consider the NIST test suite SP 800-22 and we show that, as suggested by NIST i

APA, Harvard, Vancouver, ISO, and other styles

15

Раупов, Р. Р., С. С. Логинов, И. Н. Фролов та Ю. Р. Буткевич. "Тестирование на «случайность» генераторов псевдослучайных чисел для стендов полунатурного моделирования асинхронных радиоэлектронных систем". Vestnik of Volga State University of Technology. Series Radio Engineering and Infocommunication Systems, № 4(64) (21 лютого 2025): 68–77. https://doi.org/10.25686/2306-2819.2024.4.68.

Full text

Abstract:

Разработаны программные средства моделирования двоичных последовательностей, формируемых генераторами псевдослучайных чисел по ГОСТ Р ИСО 28640 – 2012, для их дальнейшего использования в стендах полунатурного моделирования асинхронных радиоэлектронных систем. С помощью системы статистических тестов NIST проведено исследование статистических свойств сформированных разработанными генераторами псевдослучайных последовательностей и проведена их проверка на случайность посредством сравнения со статистикой идеально случайного ряда. По результатам исследования выбран пороговый уровень прохождения тес

APA, Harvard, Vancouver, ISO, and other styles

16

Hromada, Viliam, and Milan Vojvoda. "Using Poly-Dragon Cryptosystem in a Pseudorandom Number Generator Mstg." Tatra Mountains Mathematical Publications 61, no. 1 (2014): 105–16. http://dx.doi.org/10.2478/tmmp-2014-0030.

Full text

Abstract:

Abstract This paper deals with a new pseudorandom number generator MSTg proposed in 2010. Its construction is based on random covers for finite groups. We have used a public-key cryptosystem Poly-Dragon to generate these random covers and have studied the statistical properties of the resulting pseudorandom number generator by testing its output using the NIST Statistical Test Suite

APA, Harvard, Vancouver, ISO, and other styles

17

Semenkov, Alexey, Dmitry Bragin, Yakov Usoltsev, Anton Konev, and Evgeny Kostuchenko. "Generation of an EDS Key Based on a Graphic Image of a Subject’s Face Using the RC4 Algorithm." Information 12, no. 1 (2021): 19. http://dx.doi.org/10.3390/info12010019.

Full text

Abstract:

Modern facial recognition algorithms make it possible to identify system users by their appearance with a high level of accuracy. In such cases, an image of the user’s face is converted to parameters that later are used in a recognition process. On the other hand, the obtained parameters can be used as data for pseudo-random number generators. However, the closeness of the sequence generated by such a generator to a truly random one is questionable. This paper proposes a system which is able to authenticate users by their face, and generate pseudo-random values based on the facial image that w

APA, Harvard, Vancouver, ISO, and other styles

18

Stoller, Scott, and Kristy A. Campbell. "Demonstration of Three True Random Number Generator Circuits Using Memristor Created Entropy and Commercial Off-the-Shelf Components." Entropy 23, no. 3 (2021): 371. http://dx.doi.org/10.3390/e23030371.

Full text

Abstract:

In this work, we build and test three memristor-based true random number generator (TRNG) circuits: two previously presented in the literature and one which is our own design. The functionality of each circuit is assessed using the National Institute of Standards and Technology (NIST) Statistical Test Suite (STS). The TRNG circuits were built using commercially available off-the-shelf parts, including the memristor. The results of this work confirm the usefulness of memristors for successful implementation of TRNG circuits, as well as the ease with which a TRNG can be built using simple circui

APA, Harvard, Vancouver, ISO, and other styles

19

Al-Hazaimeh, Obaida M., Ashraf A. Abu-Ein, Khalid M. Nahar, and Isra S. Al-Qasrawi. "Chaotic elliptic map for speech encryption." Indonesian Journal of Electrical Engineering and Computer Science 25, no. 2 (2022): 1103–14. https://doi.org/10.11591/ijeecs.v25.i2.pp1103-1114.

Full text

Abstract:

Using a new key management system and Jacobian elliptic map, a new speech encryption scheme has been developed for secure speech communication data. Jacobian elliptic map-based speech encryption has been developed as a novel method to improve the existing speech encryption methods' drawbacks, such as poor quality in decrypted signals, residual intelligibility, high computational complexity, and low-key space. Using the Jacobian elliptic map as a key management solution, a new cryptosystem was created. The proposed scheme's performance is evaluated using spectrogram analysis, histogram

APA, Harvard, Vancouver, ISO, and other styles

20

Šajić, Slavko, Nebojša Maletić, Branislav M. Todorović, and Milan Šunjevarić. "Random Binary Sequences in Telecommunications." Journal of Electrical Engineering 64, no. 4 (2013): 230–37. http://dx.doi.org/10.2478/jee-2013-0033.

Full text

Abstract:

Realization of modern telecommunication systems is inconceivable without use of different binary sequences. In this paper, an overview of random binary sequences used in different telecommunication systems is given. Basic principles of pseudorandom, chaotic, and true random sequence generation are presented, as well as their application in telecommunications in respect to advantages and drawbacks of the same. Moreover, particular scheme for true random binary sequence generation is given, as well as results of randomness assessment obtained by NIST statistical test suite. Finally, short insigh

APA, Harvard, Vancouver, ISO, and other styles

21

TAVAS, VEDAT, AHMET S. DEMIRKOL, SERDAR OZOGUZ, ALI ZEKI, and ALI TOKER. "AN ADC BASED RANDOM BIT GENERATOR BASED ON A DOUBLE SCROLL CHAOTIC CIRCUIT." Journal of Circuits, Systems and Computers 19, no. 07 (2010): 1621–39. http://dx.doi.org/10.1142/s0218126610006918.

Full text

Abstract:

An A/D converter based random bit generator which exploits continuous-time chaos is presented. The chaotic circuit, which is used as the core of the random bit generator generates double-scroll attractor the frequency spectrum of which spans up to 80 MHz. The chaotic circuit was fabricated using a 0.35 μm CMOS process and the chip area, excluding pads, is 0.06 mm2. Power consumption of the integrated chip is 8 mW. Binary data obtained from the presented random bit generator pass the full NIST-800-22 test suite.

APA, Harvard, Vancouver, ISO, and other styles

22

Gyger, Samuel, Katharina D. Zeuner, Thomas Lettner, et al. "Metropolitan single-photon distribution at 1550 nm for random number generation." Applied Physics Letters 121, no. 19 (2022): 194003. http://dx.doi.org/10.1063/5.0112939.

Full text

Abstract:

Quantum communication networks will connect future generations of quantum processors, enable metrological applications, and provide security through quantum key distribution. We present a testbed that is part of the municipal fiber network in the greater Stockholm metropolitan area for quantum resource distribution through a [Formula: see text] long fiber based on semiconductor quantum dots emitting in the telecom C-band. We utilize the service to generate random numbers passing the NIST test suite SP800-22 at a subscriber 8 km outside of the city with a bit rate of 23.4 kbit/s.

APA, Harvard, Vancouver, ISO, and other styles

23

Lambic, Dragan, and Mladen Nikolic. "New pseudo-random number generator based on improved discrete-space chaotic map." Filomat 33, no. 8 (2019): 2257–68. http://dx.doi.org/10.2298/fil1908257l.

Full text

Abstract:

In this paper, a new pseudo-random number generator (PRNG) based on improved onedimensional discrete-space chaotic map is proposed. Like the original, the improved map relies on bijective mapping of permutations and natural numbers. Instead of using standard Lehmer code, we use a mapping computable in linear time, which significantly speeds up the PRNG. Results of NIST 800-22 test suite and TestU01 test suite confirm that the proposed approach can be used for generation of pseudo-random numbers. Due to discrete nature of used chaotic map, the proposed PRNG is not influenced by dynamical degrad

APA, Harvard, Vancouver, ISO, and other styles

24

Arroyo, Jan Carlo T., Ariel M. Sison, Ruji P. Medina, and Allemar Jhone P. Delima. "A Cryptographic Test of Randomness, Entropy, and Brute Force Attack on the Modified Playfair Algorithm with the Novel Dynamic Matrix." International Journal of Emerging Technology and Advanced Engineering 12, no. 6 (2022): 73–83. http://dx.doi.org/10.46338/ijetae0622_11.

Full text

Abstract:

One critical concern in designing a cryptographic algorithm is its randomness. The randomness test examines the quality of random numbers generated by cryptographic algorithms. In this paper, the National Institute of Standards and Technology (NIST) Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications was instrumental in assessing the security of the modified Playfair algorithm with the novel Multidimensional Element-in-Grid Sequencer (MEGS). Moreover, this study determines the level of security of the MEGS-based Playfair algorithm against brute f

APA, Harvard, Vancouver, ISO, and other styles

25

Auday, H. Al-Wattar, Mahmod Ramlan, Ahmad Zukarnain Zuriati, and Izura Udzir Nur. "A NEW DNA BASED APPROACH OF GENERATING KEYDEPENDENT SHIFT ROWS TRANSFORMATION." International Journal of Network Security & Its Applications (IJNSA) 7, no. 1 (2015): 79–89. https://doi.org/10.5281/zenodo.7889183.

Full text

Abstract:

The use of key-dependent shiftRows can be considered as one of the applied methods for altering the quality of a cryptographic algorithm. This article describes one approach for changing the ShiftRows transformation employed in the algorithm AES. The approach employs methods inspired from DNA processes and structure which depended on the key while the parameters of the created new ShiftRows have characteristics identical to those of the original algorithm AES in addition to increase its resistance against attacks. The proposed new ShiftRows were tested for coefficient correlation for dynamic a

APA, Harvard, Vancouver, ISO, and other styles

26

Mamun, Md Selim Al, and Fatema Akhter. "Pseudo Random Binary Sequence Based on Cyclic Difference Set." Symmetry 12, no. 8 (2020): 1202. http://dx.doi.org/10.3390/sym12081202.

Full text

Abstract:

With the increasing reliance on technology, it has become crucial to secure every aspect of online information where pseudo random binary sequences (PRBS) can play an important role in today’s world of Internet. PRBS work in the fundamental mathematics behind the security of different protocols and cryptographic applications. This paper proposes a new PRBS namely MK (Mamun, Kumu) sequence for security applications. Proposed sequence is generated by primitive polynomial, cyclic difference set in elements of the field and binarized by quadratic residue (QR) and quadratic nonresidue (QNR). Introd

APA, Harvard, Vancouver, ISO, and other styles

27

Becerra, María de Lourdes Rivas, Juan José Raygoza Panduro, Edwin Christian Becerra Alvarez, Susana Ortega Cisneros, and José Luis González Vidal. "Design and Hardware Implementation of a Highly Flexible PRNG System for NIST-Validated Pseudorandom Sequences." Chips 4, no. 2 (2025): 23. https://doi.org/10.3390/chips4020023.

Full text

Abstract:

This work presents the design of a system of a highly flexible pseudorandom number generator system (PRNG) incorporating both conventional and neuro-generators. The system integrates four internal generators with different conditions to produce new output sequences with adequate bits distribution and complexity. Two generators function at a frequency of 100 MHz with adjustable frequency settings, while two neuro-generators employ impulse neurons with distinct behaviours at 4 kHz, also modifiable. The proposed system meets 12 statistical randomness standards based on NIST’s (National Institute

APA, Harvard, Vancouver, ISO, and other styles

28

Ramadhanti, Fitri, and Bahrianto Prakoso. "Key Generation Based on Face Image Processing Using Kanade-Lucas-Tomasi Algorithm." Info Kripto 18, no. 1 (2024): 1–8. http://dx.doi.org/10.56706/ik.v18i1.84.

Full text

Abstract:

Sistem biometrik menawarkan keunggulan yaitu memiliki keunikan yang berbeda pada setiap manusia. Biometrik juga memiliki keunggulan yaitu bersifat permanen, sulit dipalsukan, sulit diretas atau dicuri, dan anti penyangkalan. Dari berbagai banyak keunggulan biomterik maka penelitian ini membahas pembangkitan kunci berbasis biometrik wajah. Syarat suatu angka acak dianggap sebagai kunci kriptografi yang baik adalah angka acak tersebut lulus uji keacakan. Pada penelitian ini menggunakan algoritma Kanade-Lucas-Tomasi (KLT) untuk pelacakan titik unik wajah dan algoritma Viola Jones untuk pendeteksi

APA, Harvard, Vancouver, ISO, and other styles

29

Irfan, Muhammad, Asim Ali, Muhammad Asif Khan, et al. "Pseudorandom Number Generator (PRNG) Design Using Hyper-Chaotic Modified Robust Logistic Map (HC-MRLM)." Electronics 9, no. 1 (2020): 104. http://dx.doi.org/10.3390/electronics9010104.

Full text

Abstract:

Robust chaotic systems, due to their inherent properties of mixing, ergodicity, and larger chaotic parameter space, constitute a perfect candidate for cryptography. This paper reports a novel method to generate random numbers using modified robust logistic map (MRLM). The non-smooth probability distribution function of robust logistic map (RLM) trajectories gives an un-even binary distribution in randomness test. To overcome this disadvantage in RLM, control of chaos (CoC) is proposed for smooth probability distribution function of RLM. For testing the proposed design, cryptographic random num

APA, Harvard, Vancouver, ISO, and other styles

30

Xingyuan, Wang, Qin Xue, and Teng Lin. "A Novel True Random Number Generator Based on Mouse Movement and a One-Dimensional Chaotic Map." Mathematical Problems in Engineering 2012 (2012): 1–9. http://dx.doi.org/10.1155/2012/931802.

Full text

Abstract:

We propose a novel true random number generator using mouse movement and a one-dimensional chaotic map. We utilize thex-coordinate of the mouse movement to be the length of an iteration segment of our TRNs and they-coordinate to be the initial value of this iteration segment. And, when it iterates, we perturb the parameter with the real value produced by the TRNG itself. And we find that the TRNG we proposed conquers several flaws of some former mouse-based TRNGs. At last we take experiments and test the randomness of our algorithm with the NIST statistical test suite; results illustrate that

APA, Harvard, Vancouver, ISO, and other styles

31

Chun, Sungwoo, Seung-Beck Lee, Masahiko Hara, Wanjun Park, and Song-Ju Kim. "High-Density Physical Random Number Generator Using Spin Signals in Multidomain Ferromagnetic Layer." Advances in Condensed Matter Physics 2015 (2015): 1–8. http://dx.doi.org/10.1155/2015/251819.

Full text

Abstract:

A high-density random number generator (RNG) based on spin signals in a multidomain ferromagnetic layer in a magnetic tunnel junction (MTJ) is proposed and fabricated. Unlike conventional spin-based RNGs, the proposed method does not require one to control an applied current, leading to a time delay in the system. RNG demonstrations are performed at room temperature. The randomness of the bit sequences generated by the proposed RNG is verified using the FIPS 140-2 statistical test suite provided by the NIST. The test results validate the effectiveness of the proposed RNGs. Our results suggest

APA, Harvard, Vancouver, ISO, and other styles

32

ABID, A. M., Q. NASIR, and A. S. ELWAKIL. "IMPLEMENTATION OF AN ENCRYPTED WIRELESS COMMUNICATION SYSTEM USING NESTED CHAOTIC MAPS." International Journal of Bifurcation and Chaos 20, no. 12 (2010): 4087–96. http://dx.doi.org/10.1142/s0218127410027957.

Full text

Abstract:

This paper proposes an implementation of a synchronization method for wireless communication systems using a pseudo-True Random Bit Generator (PTRBG) based on chaotic maps. Chaos is generated using Nested Piecewise Linear Maps (NPWLM) to improve the statistical degradation introduced due to finite word length processing. Synchronization of nested maps using the backward iteration algorithm is introduced. This algorithm uses a mathematically driven formula to determine the initial condition of the nested map at the receiver in order to synchronize with the map at the transmitter. The implementa

APA, Harvard, Vancouver, ISO, and other styles

33

A. Baker, Shatha, and Ahmed S. Nori. "Comparison of the Randomness Analysis of the Modified Rectangle Block Cipher and Original algorithm." NTU Journal of Pure Sciences 1, no. 2 (2022): 10–21. http://dx.doi.org/10.56286/ntujps.v1i2.185.

Full text

Abstract:

In recent years, different encryption lightweight algorithms have been suggested to protect the security of data transferred across the IoT network. The symmetric key ciphers play a significant role in the security of devices, in particular block ciphers. the RECTANGLE algorithm amongst the current lightweight algorithms. Rectangle algorithm does have good encryption efficacy but the characteristics of confusion and diffusion that a cipher needed are lacking from this algorithm. Therefore, by improving the algorithm confusion and diffusion properties, we expanded Rectangle utilizing a 3D ciphe

APA, Harvard, Vancouver, ISO, and other styles

34

Rocha, Bruno Santos, Jose Antonio Moreira Xexeo, and Renato Hidaka Torres. "Post-quantum cryptographic algorithm identification using machine learning." Journal of Information Security and Cryptography (Enigma) 9, no. 1 (2022): 1–8. http://dx.doi.org/10.17648/jisc.v9i1.81.

Full text

Abstract:

This research presents a study on the identification of post-quantum cryptography algorithms through machine learning techniques. Plain text files were encoded by four post-quantum algorithms, participating in NIST's post-quantum cryptography standardization contest, in ECB mode. The resulting cryptograms were submitted to the NIST Statistical Test Suite to enable the creation of metadata files. These files provide information for six data mining algorithms to identify the cryptographic algorithm used for encryption. Identification performance was evaluated in samples of different sizes. The s

APA, Harvard, Vancouver, ISO, and other styles

35

Bearden, Daniel W., David A. Sheen, Yamil Simón-Manso, et al. "Metabolomics Test Materials for Quality Control: A Study of a Urine Materials Suite." Metabolites 9, no. 11 (2019): 270. http://dx.doi.org/10.3390/metabo9110270.

Full text

Abstract:

There is a lack of experimental reference materials and standards for metabolomics measurements, such as urine, plasma, and other human fluid samples. Reasons include difficulties with supply, distribution, and dissemination of information about the materials. Additionally, there is a long lead time because reference materials need their compositions to be fully characterized with uncertainty, a labor-intensive process for material containing thousands of relevant compounds. Furthermore, data analysis can be hampered by different methods using different software by different vendors. In this w

APA, Harvard, Vancouver, ISO, and other styles

36

Andreeva, Elena, and Andreas Weninger. "A TPRF-based pseudo-random number generator." Journal of Surveillance, Security and Safety 5, no. 1 (2024): 36–51. http://dx.doi.org/10.20517/jsss.2023.45.

Full text

Abstract:

Most cryptographic applications use randomness that is generated by pseudo-random number generators (PRNGs). A popular PRNG practical choice is the NIST standardized $$ \rm{CTR\_DRBG}$$ . In their recent ACNS 2023 publication, Andreeva and Weninger proposed a new and more efficient and secure PRNG called $$ \mathtt{FCRNG}$$ . $$ \mathtt{FCRNG}$$ is based on $$ \rm{CTR\_DRBG}$$ and uses the $$ n $$ -to-$$ 2n $$ forkcipher expanding primitive ForkSkinny as a building block. In this work, we create a new BKRNG PRNG, which is based on $$ \mathtt{FCRNG}$$ and employs the novel $$ n $$ -to-$$ 8n $$

APA, Harvard, Vancouver, ISO, and other styles

37

Linh, Hoang Dinh, та Trần Thị Lượng. "Một số cải tiến cho các kiểm tra thống kê tính ngẫu nhiên sử dụng so khớp mẫu". Journal of Science and Technology on Information security 1, № 13 (2021): 49–61. http://dx.doi.org/10.54654/isj.v1i13.115.

Full text

Abstract:

Tóm tắt—Các kiểm tra liên quan đến so khớp mẫu chồng lấp đã được đề xuất trong NIST SP 800-22 [1], tuy nhiên các xác suất trong các kiểm tra này chỉ đúng cho các mẫu đặc biệt và cần được tính lại cho các mẫu khác. Trong [2], các tác giả đã đề xuất các tiêu chuẩn thống kê so khớp mẫu mới cho tất cả các mẫu 4 bit. Các kiểm tra mới này áp dụng cho chuỗi bất kỳ có độ dài tối thiểu là 5504 bit, trong khi theo NIST độ dài tối thiểu 106 bit. Trong bài báo này, chúng tôi đã cải tiến và đề xuất các kiểm tra so khớp mẫu 4 bit mới mà có thể áp dụng cho các chuỗi bất kỳ có độ dài nhỏ nhất chỉ là 3726 bit.

APA, Harvard, Vancouver, ISO, and other styles

38

Anh, Nguyễn Tuấn, та Triệu Quang Phong. "Mối liên hệ giữa tính nhận biết tiền ảnh và một số tính chất mật mã khác của hàm băm". Journal of Science and Technology on Information security 1, № 13 (2021): 12–20. http://dx.doi.org/10.54654/isj.v1i13.128.

Full text

Abstract:

Tóm tắt—Các kiểm tra liên quan đến so khớp mẫu chồng lấp đã được đề xuất trong NIST SP 800-22 [1], tuy nhiên các xác suất trong các kiểm tra này chỉ đúng cho các mẫu đặc biệt và cần được tính lại cho các mẫu khác. Trong [2], các tác giả đã đề xuất các tiêu chuẩn thống kê so khớp mẫu mới cho tất cả các mẫu 4 bit. Các kiểm tra mới này áp dụng cho chuỗi bất kỳ có độ dài tối thiểu là 5504 bit, trong khi theo NIST độ dài tối thiểu 106 bit. Trong bài báo này, chúng tôi đã cải tiến và đề xuất các kiểm tra so khớp mẫu 4 bit mới mà có thể áp dụng cho các chuỗi bất kỳ có độ dài nhỏ nhất chỉ là 3726 bit.

APA, Harvard, Vancouver, ISO, and other styles

39

TANG, K. W., WALLACE K. S. TANG, and K. F. MAN. "A CHAOS-BASED PSEUDO-RANDOM NUMBER GENERATOR AND ITS APPLICATION IN VOICE COMMUNICATIONS." International Journal of Bifurcation and Chaos 17, no. 03 (2007): 923–33. http://dx.doi.org/10.1142/s021812740701763x.

Full text

Abstract:

In this paper, a fast chaos-based pseudo-random number generator (PRNG) is proposed for secured communications. In order to achieve fast throughput and facilitate hardware realization, 32-bit fixed point representation and arithmetic are used. Even under such configuration with quantization errors which will make the normal chaos-based PRNG impractical, our scheme can pass all the statistical tests in the up-to-date National Institute of Standards and Technology (NIST) test suite with the output bit rate up to 134 Mbps in a 2.6 GHz Pentium-4 machine. With such a fast PRNG, a stream cipher is h

APA, Harvard, Vancouver, ISO, and other styles

40

Rojas-Muñoz, Luis F., Santiago Sánchez-Solano, Macarena C. Martínez-Rodríguez, and Piedad Brox. "True Random Number Generation Capability of a Ring Oscillator PUF for Reconfigurable Devices." Electronics 11, no. 23 (2022): 4028. http://dx.doi.org/10.3390/electronics11234028.

Full text

Abstract:

This paper presents the validation of a novel approach for a true-random number generator (TRNG) based on a ring oscillator–physical unclonable function (RO-PUF) for FPGA devices. The proposal takes advantage of the different noise sources that affect the electronic implementation of the RO-PUF to extract the entropy required to guarantee its function as a TRNG, without anything more than minimal changes to the original design. The new RO-PUF/TRNG architecture has been incorporated within a hybrid HW/SW embedded system designed for devices from the Xilinx Zynq-7000 family. The degree of random

APA, Harvard, Vancouver, ISO, and other styles

41

Pareschi, Fabio, Riccardo Rovatti, and Gianluca Setti. "On Statistical Tests for Randomness Included in the NIST SP800-22 Test Suite and Based on the Binomial Distribution." IEEE Transactions on Information Forensics and Security 7, no. 2 (2012): 491–505. http://dx.doi.org/10.1109/tifs.2012.2185227.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Nanda, Surendra Kumar, Suneeta Mohanty, and Prasant Kumar Pattnaik. "An optimized 128-bit cellular automata-based hash function for authentication of data at rest and in transit." International Journal of Electrical and Computer Engineering (IJECE) 13, no. 2 (2023): 1858. http://dx.doi.org/10.11591/ijece.v13i2.pp1858-1866.

Full text

Abstract:

The cryptographic hash functions are the most fundamental cryptographic concept. These functions are used as basic building blocks for digital signatures and message authentication. Boolean functions are the core of hash functions. These functions are expected to provide pseudo-randomness as well as input sensitivity. Cellular automata are a form of Boolean function that exhibits strong cryptography properties as well as chaotic behavior. This paper proposes a hash function, designed on the principle of cellular automata. The proposed algorithm is secure and meets the requirements for a succes

APA, Harvard, Vancouver, ISO, and other styles

43

Surendra, Kumar Nanda, Mohanty Suneeta, and Kumar Pattnaik Prasant. "An optimized 128-bit cellular automata-based hash function for authentication of data at rest and in transit." International Journal of Electrical and Computer Engineering (IJECE) 13, no. 2 (2023): 1858–66. https://doi.org/10.11591/ijece.v13i2.pp1858-1866.

Full text

Abstract:

The cryptographic hash functions are the most fundamental cryptographic concept. These functions are used as basic building blocks for digital signatures and message authentication. Boolean functions are the core of hash functions. These functions are expected to provide pseudo-randomness as well as input sensitivity. Cellular automata are a form of Boolean function that exhibits strong cryptography properties as well as chaotic behavior. This paper proposes a hash function, designed on the principle of cellular automata. The proposed algorithm is secure and meets the requirements for a succes

APA, Harvard, Vancouver, ISO, and other styles

44

Bader, Ansam Sabah, Shaymaa Hameed, and Maisa’a Abid Ali K. "Key Generation based on Henon map and Lorenz system." Al-Mustansiriyah Journal of Science 31, no. 1 (2020): 41. http://dx.doi.org/10.23851/mjs.v31i1.734.

Full text

Abstract:

Securing information has been the most significant process for communication and data store. Orderly to secure information such as data authentication, data integrity, and confidentiality must be verified based on algorithms of cryptography. Where, the most important part of any encryption algorithms is the key which specifies if the system is strong enough or not. The proposal of this paper is a new method to generate keys based on two kinds of chaos theory in order to improve the security of cryptographic algorithms. The base of this proposal is to investigate a new method for generating ran

APA, Harvard, Vancouver, ISO, and other styles

45

Kim, Taeyueb, HeeGyum Park, Ki-Hyuk Han, et al. "Demonstration of in-plane magnetized stochastic magnetic tunnel junction for binary stochastic neuron." AIP Advances 12, no. 7 (2022): 075104. http://dx.doi.org/10.1063/5.0090577.

Full text

Abstract:

A binary stochastic neuron (BSN) or a probabilistic bit (p-bit) randomly fluctuates between digitized “0” and “1” with a controllable functionality of time-averaged value. Such an unconventional bit is the most essential building block for the recently proposed stochastic neural networks and probabilistic computing. Here, we experimentally implement a magnetic tunnel junction (MTJ) for BSN, with relaxation times on the order of tens of milliseconds that can be modulated by a current-induced spin-transfer torque. The NIST Statistical Test Suite (800-22a) is used to verify true random number gen

APA, Harvard, Vancouver, ISO, and other styles

46

Amr, Sayed Abdel Fattah Youssef. "Design, Implementing, and Testing a Novel Chaotic Random Generator CRN." International Journal of Recent Technology and Engineering (IJRTE) 12, no. 1 (2023): 72–80. https://doi.org/10.35940/ijrte.A7524.0512123.

Full text

Abstract:

<strong>Abstract: </strong>Nowadays, the importance of implementing a secure communication system that protects the privacy and confidential information from cyber-attacks and eavesdroppers is widely recognized. This requires developing solutions that not only address security issues but should not affect the speed of our system also. To achieve secure communication, most security systems rely on randomness generators, which play a vital role in the encryption process, with more randomness equaling greater security. In this paper, we propose a methodology for designing and implementing a novel

APA, Harvard, Vancouver, ISO, and other styles

47

Yakut, Selman, Taner Tuncer, and Ahmet Bedri Özer. "A New Secure and Efficient Approach for TRNG and Its Post-Processing Algorithms." Journal of Circuits, Systems and Computers 29, no. 15 (2020): 2050244. http://dx.doi.org/10.1142/s0218126620502448.

Full text

Abstract:

Random numbers are important parameters for the security of cryptographic applications. In this study, a secure and efficient generator is proposed to generate random numbers. The first part of the generator is a true random number generator that consists of chaotic systems implemented on FPGA. The second part of the generator is a post-processing algorithm used to overcome the problems that emerge from the generator or environmental factors. As the post-processing algorithm, Keccak, the latest standard of hash algorithm, was rearranged and used. Random numbers with the proposed approach meet

APA, Harvard, Vancouver, ISO, and other styles

48

Lara, Evangelina, Leocundo Aguilar, Jesús García, and Mauricio Sanchez. "A Lightweight Cipher Based on Salsa20 for Resource-Constrained IoT Devices." Sensors 18, no. 10 (2018): 3326. http://dx.doi.org/10.3390/s18103326.

Full text

Abstract:

The Internet of Things (IoT) paradigm envisions a world where everyday things interchange information between each other in a way that allows users to make smarter decisions in a given context. Even though IoT has many advantages, its characteristics make it very vulnerable to security attacks. Ciphers are a security primitive that can prevent some of the attacks; however, the constrained computing and energy resources of IoT devices impede them from implementing current ciphers. This article presents the stream cipher Generador de Bits Pseudo Aleatorios (GBPA) based on Salsa20 cipher, which i

APA, Harvard, Vancouver, ISO, and other styles

49

Marszalek, Wieslaw, Michał Melosik, Mariusz Naumowicz, and Przemysław Głowacki. "Applicability and Design Considerations of Chaotic and Quantum Entropy Sources for Random Number Generation in IoT Devices." Entropy 27, no. 7 (2025): 726. https://doi.org/10.3390/e27070726.

Full text

Abstract:

This article presents a comparative analysis of two types of generators of random sequences: one based on a discrete chaotic system being the logistic map, and the other being a commercial quantum random number generator QUANTIS-USB-4M. The results of the conducted analysis serve as a guide for selecting the type of generator that is more suited for a specific IoT solution, depending on the functional profile of the target application and the amount of random data required in the cryptographic process. This article discusses both the theoretical foundations of chaotic phenomena underlying the

APA, Harvard, Vancouver, ISO, and other styles

50

Fernández, Norberto, Fernando Quintas, Luis Sánchez, and Jesús Arias. "Social Noise: Generating Random Numbers from Twitter Streams." Fluctuation and Noise Letters 14, no. 01 (2014): 1550012. http://dx.doi.org/10.1142/s0219477515500121.

Full text

Abstract:

Due to the multiple applications of random numbers in computer systems (cryptography, online gambling, computer simulation, etc.) it is important to have mechanisms to generate these numbers. True Random Number Generators (TRNGs) are commonly used for this purpose. TRNGs rely on non-deterministic sources to generate randomness. Physical processes (like noise in semiconductors, quantum phenomenon, etc.) play this role in state of the art TRNGs. In this paper, we depart from previous work and explore the possibility of defining social TRNGs using the stream of public messages of the microbloggin

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!