Linear Congruential Generator Research Articles

Aplikasi Pengenalan Organisasi Muhammadiyah Berbasis Android Menggunakan Metode Linear Congruent Generator

Misconceptions about Islamic teachings that are understood by some Indonesian Muslims are the result of an unfinished adaptation between Islam and the local traditions of the archipelago, which initially contained animism and dynamism. So that in practice Muslims in Indonesia show things that are contrary to the principles of Islamic teachings, especially those related to the principles of the Islamic creed which reject all forms of polytheism, taqlid, bid'ah, and superstition. To introduce Muhammadiyah teachings requires the help of technology that is currently developing. By using android, we can introduce Muhammadiyah to more people because it can be used anywhere and anytime. The application will display the history of the founding of Muhammadiyah, the teachings of Muhammadiyah and the practical worship of Muhammadiyah. It is hoped that this application will introduce Muhammadiyah teachings more easily with a wider reach. To attract the interest of children and adolescents in getting to know Muhammadiyah teachings, the author will add a quiz feature or question and answer practice so that there is interaction between the user and the application that is like educational games. In the quiz feature, the Linear Congruent Generator (LCG) algorithm will be implemented which functions to randomize the questions so that the questions that appear will always change. Applications for the introduction of Islam based on Android using the linear congruent generator method were successfully built using the Java programming language with Android studio software. Applications can provide discussion material about Muhammadiyah. Randomization of questions using the LCM Algorithm (Linear Congruent Method) has repetition but is easy to understand and implement into the application.

Aplikasi Arisan Marga Berbasis Web Menggunakan Metode Linear Congruential Generator

The advancement of technology has significantly impacted various aspects of life, including the traditional practice of "arisan marga" among the Batak ethnic group. Despite having been conducted manually for many years, technological progress has opened up opportunities for automation and efficiency improvement through application development. Therefore, this research aims to develop a web-based application for "arisan marga" that utilizes the Linear Congruential Generator (LCG) method for the drawing of arisan recipients and incorporates e-voting for the election of committee members. The development process involves PHP as the base, supported by the Codeigniter framework and MySQL database. The research results demonstrate the application's effectiveness in managing member data, arisan finances, and conducting fair and random arisan drawings. This innovative solution enables the execution of "arisan marga" in a modern manner, allowing for online implementation while maintaining transparency and fostering close relationships among the members. As an effective alternative, this web application can be utilized by the "marga" community to preserve and modernize the tradition of "arisan" digitally.

Analysis of pseudo-random number generators in QMC-SSE method

In the quantum Monte Carlo (QMC) method, the pseudo-random number generator (PRNG) plays a crucial role in determining the computation time. However, the hidden structure of the PRNG may lead to serious issues such as the breakdown of the Markov process. Here, we systematically analyze the performance of different PRNGs on the widely used QMC method known as the stochastic series expansion (SSE) algorithm. To quantitatively compare them, we introduce a quantity called QMC efficiency that can effectively reflect the efficiency of the algorithms. After testing several representative observables of the Heisenberg model in one and two dimensions, we recommend the linear congruential generator as the best choice of PRNG. Our work not only helps improve the performance of the SSE method but also sheds light on the other Markov-chain-based numerical algorithms.

Design of S-box multi-objective optimization algorithm based on combined chaotic system

S-box is the only nonlinear cryptographic component that determines the security of the block cipher. The higher the security of the S-box, the higher the security of the block cipher. Therefore, this paper proposes an S-box multi-objective optimization algorithm based on the combined chaotic system. Firstly, designing an integrated chaotic system based on a fractional index and its dynamic behavior is studied; it shows incredibly high-performance stability and chaotic parameter range coverage in the entire parameter space. A novel chaotic S-box construction algorithm is proposed based on the combined chaotic system. It introduces a linear congruential pseudo-random number generator to extend the sequence period and scramble the chaotic S-box through Henon mapping to improve the nonlinearity of the s-box. Finally, introducing a teaching and learning multi-objective optimization model and the performance evaluation criteria of the S-box are incorporated into the design of the objective function; this design enables the resulting S-box to perform well under multiple performance indicators, and then the approximate optimal S-box in the population is obtained. Through the performance test of the approximate optimal S-box, the comparative analysis shows that the S-box has good cryptographic performance, can resist linear analysis and differential analysis, and has a good application prospect in lightweight cipher.

Comparative Analysis of Pseudorandom Number Generators: Mersenne Twister, Middle Square Method, and Linear Congruential Generator through Dieharder Tests

Comparative Analysis of Pseudorandom Number Generators: Mersenne Twister, Middle Square Method, and Linear Congruential Generator through Dieharder Tests

On a Vernam cipher scheme based on elliptic curve L-functions

In this paper, we present a new Vernam-like cryptosystem based on the L-functions attached to elliptic curves. Actually, we show that for infinitely many elliptic curves, the coefficients of the L-series can be considered as a secure cryptographic cipher key when combined with linear and classical pseudo-random number generators. Hence, fast and widely known classical generators, like linear congruential generators, should be reintroduced into our list of cryptographic design choices.

An Adaptive Fractal Image Steganography Using Mandelbrot and Linear Congruent Generator

Despite the advancements that occurred in the field of technology, information security (i.e., IS) is still deemed important and critical topic. It is still especially deemed so during the transfer process. In this research, a new approach is proposed for hiding information through the use of iterated function systems (i.e., IFS) from Fractals. This approach employs the main feature of fractals that concentrate on the idea that hackers who seek to find the hidden data shall not be able of locating it. Therefore, there is a need to carry out a decoding process in the aim of revering the conversion for securing the transmitted information. In this research, the secure information is hidden inside a fractal Mandelbrot image using the Linear Congruent Generator (i.e., LCG). Regarding the proposed system, it generates the fractal image through the use of the predefined knowledge gained from the hider site that works as a host for different types of secret messages. The knowledge that comes from the key of image dimensions, parameters of Mandelbrot, LCG key, and key agreement of cryptography method, which makes Stego-image analyses of hidden data unacceptable without the correct knowledge. Based on the results that are obtained through carrying out experiments showed the proposed method meets all the requirements for steganography. Such requirements include: the ones related to capacity, visual appearance, undetectability, robustness against extraction (i.e., security), and hit the highest capacities with a visual appearance of high quality.

Random Number Generators: Principles and Applications

In this paper, we present approaches to generating random numbers, along with potential applications. Rather than trying to provide extensive coverage of several techniques or algorithms that have appeared in the scientific literature, we focus on some representative approaches, presenting their workings and properties in detail. Our goal is to delineate their strengths and weaknesses, as well as their potential application domains, so that the reader can judge what would be the best approach for the application at hand, possibly a combination of the available approaches. For instance, a physical source of randomness can be used for the initial seed; then, suitable preprocessing can enhance its randomness; then, the output of preprocessing can feed different types of generators, e.g., a linear congruential generator, a cryptographically secure one and one based on the combination of one-way hash functions and shared key cryptoalgorithms in various modes of operation. Then, if desired, the outputs of the different generators can be combined, giving the final random sequence. Moreover, we present a set of practical randomness tests that can be applied to the outputs of random number generators in order to assess their randomness characteristics. In order to demonstrate the importance of unpredictable random sequences, we present an application of cryptographically secure generators in domains where unpredictability is one of the major requirements, i.e., eLotteries and cryptographic key generation.

Android-Based Muhammadiyah Organization Introduction Application Using the Linear Congruent Generator Method

The aim of the research is to build an android-based application for introducing the Muhammadiyah organization using a Linear Congruent Generator, to introduce Muhammadiyah teachings to many people more easily and to provide knowledge about Muhammadiyah worship procedures. its function in the development of Islam in Indonesia, which so far has been carried out through branches and branches throughout the archipelago. The solution to this problem is to introduce Muhammadiyah teachings, it requires the help of technology that is currently developing. By using Android, we can introduce Muhammadiyah to more people because it can be used anywhere and anytime. In the application, it will be displayed starting from the history of the founding of Muhammadiyah, Muhammadiyah teachings and Muhammadiyah practical worship. It is hoped that with this application in Test results The nature of the Linear Congruent Method (LCM) method is that repetition occurs at a certain time period or after a certain number of times of generation so that there are no repetitions in the problem, the choice of constant values ​​must be correct and the existence of a shuffling process, helps overcome the problem of Linear Congruential Generator (LCG).

A Novel High Computing Power Efficient VLSI Architectures of Three Operand Binary Adders

Directly or indirectly adders are the basic elements in almost all digital circuits, three operand adders are the basic building blocks in LCG (Linear congruential generator) based pseudo-random bit generators. Elementary adders are fast, area and power efficient for small bit sizes. Carry save adder computes the addition in O(n) time complexity, due to its ripple carry stage. Parallel prefix adders such as Han-Carlson compute the addition in O(log(n)) time complexity but at the cost of additional circuitry. Hence new high-speed power-efficient adder architecture is proposed which uses four stages to compute the addition, which consumes less power, and the adder delay decreases to O(n/2). Even though it is not much faster than the High-speed Area efficient VLSI architecture of three operand adders (HSAT3), it computes the addition by utilizing less power. The proposed architecture is implemented using Verilog HDL in Xilinx 14.7 design environment and it is evident that this adder architecture is 2 times faster than the carry save adder and 1, 1.5, 1.75 times faster than the hybrid adder structure for 32, 64, 128 bits respectively. Also, power utilization is 1.95 times lesser than HSAT3, 1.94 times lesser than the Han-Carlson adder, and achieves the lowest PDP than the existing three operand techniques.

Comparison of the Fisher-Yates Shuffle and the Linear Congruent Algorithm for Randomizing Questions in Nahwu Learning Multimedia

Nahwu Quiz is a basic Arabic learning application that can be played by the public over the age of 12 years. In the question practice menu, there are questions and 4 multiple choice questions. The user only needs to choose one of the multiple choices that the user thinks is correct/matches the question at hand. In one game, there are 5 questions. After answering all these questions, you will immediately see the score. The purpose of developing this application apart from being a medium of entertainment as well as a medium of learning and memory training for game users (users). To make this Nahwu Quiz application, the authors use the Fisher Yates Shuffle (FYS) algorithm which is used to perform the randomization function in multiple choice and the Linear Congruent Method (LCM) algorithm as a comparison. White box and black box testing were applied to see the feasibility of the program and to obtain efficiency in the comparison of randomization methods. The results of white box and black box testing on the application show that the application is feasible. with reference to the white box test results that the FYS algorithm and the LCM have the same complexity as the result of cyclomatic complexity = 2.

An Efficient Substitution Box design with a chaotic logistic map and Linear Congruential Generator for secure communication in Smart cities

The study provides a unique method for creating an efficient substitution box (S-box) for advanced encryption standards using a Chaotic Logistic Map (CLM) and a Linear Congruential Generator (LCG) (AES) for secure communications in a smart city. The Pseudo-Random Number Generator (PRNG), which is further examined, is constructed using an extensive search of reasonable possibilities for the initial seed and set parameters. Using statistical testing, the performance analysis of the new S-box is assessed. Additionally, the resilience of differential, as well as linear cryptanalysis, is shown. It is derived using other features, including nonlinearity, the Bit Independence Criterion (BIC), and the Strict Avalanche Criterion (SAC). The suggested S-box has good potential and is usable for symmetric key cryptography, according to the features of the new S-cryptographic box.

Pengamanan Pesan Menggunakan Algoritma One Time Pad dengan Linear Congruential Generator sebagai Pembangkit Kunci

Cryptography is one method that can be used to secure a message by hiding the original text. This study uses the One Time Pad (OTP) algorithm to secure a message and the Linear Congruential Generator (LCG) algorithm as a key generator. The purpose of this study is to describe the key generation process using the LCG algorithm, the encryption and decryption process of messages using the OTP algorithm. The process of encrypting and decrypting messages using the OTP algorithm requires a key as long as the original message and must be random. Therefore, a random number generation process is carried out using the LCG algorithm before encoding the message. The results of this study are the LCG algorithm is able to build dynamic keys with the condition that the length of the period must be greater than or equal to the length of the plaintext. The process of encoding messages using the OTP algorithm has a high level of security because the number of characters used is more and the process of sending messages is easier. The resulting ciphertext is a very random and unreadable message that is difficult to decipher.

The implementation of augmented reality in geometry for primary school students

Mathematics is a subject studied from elementary education up to the university level. In general, learning mathematics uses a conventional approach using a whiteboard. This method has shortcomings in the process of visualization and simulation, especially in the material of geometry. This research develops a learning application by utilizing Augmented Reality technology with the content of geometry for sixth-grade primary school students. Augmented Reality can visualize and simulate geometry for students with an interaction model. Linear Congruential Generator (LCG) and Fuzzy Tsukamoto methods are used in this application as a randomization method and score determination method. The results obtained from the testing process show that the LCG and fuzzy Tsukamoto methods can run according to the design. In user testing using a questionnaire, the results obtained 4.6 of scale 5.0 indicating that respondents provided good responses for the Augmented Reality Geometry application.

Ensuring confidentiality and privacy of cloud data using a non-deterministic cryptographic scheme.

The amount of data generated by electronic systems through e-commerce, social networks, and data computation has risen. However, the security of data has always been a challenge. The problem is not with the quantity of data but how to secure the data by ensuring its confidentiality and privacy. Though there are several research on cloud data security, this study proposes a security scheme with the lowest execution time. The approach employs a non-linear time complexity to achieve data confidentiality and privacy. A symmetric algorithm dubbed the Non-Deterministic Cryptographic Scheme (NCS) is proposed to address the increased execution time of existing cryptographic schemes. NCS has linear time complexity with a low and unpredicted trend of execution times. It achieves confidentiality and privacy of data on the cloud by converting the plaintext into Ciphertext with a small number of iterations thereby decreasing the execution time but with high security. The algorithm is based on Good Prime Numbers, Linear Congruential Generator (LGC), Sliding Window Algorithm (SWA), and XOR gate. For the implementation in C#, thirty different execution times were performed and their average was taken. A comparative analysis of the NCS was performed against AES, DES, and RSA algorithms based on key sizes of 128kb, 256kb, and 512kb using the dataset from Kaggle. The results showed the proposed NCS execution times were lower in comparison to AES, which had better execution time than DES with RSA having the longest. Contrary, to existing knowledge that execution time is relative to data size, the results obtained from the experiment indicated otherwise for the proposed NCS algorithm. With data sizes of 128kb, 256kb, and 512kb, the execution times in milliseconds were 38, 711, and 378 respectively. This validates the NCS as a Non-Deterministic Cryptographic Algorithm. The study findings hence are in support of the argument that data size does not determine the execution time of a cryptographic algorithm but rather the size of the security key.

Color Image Encryption Through Chaos and KAA Map

The unprecedented growth in production and exchange of multimedia over unsecured channels is overwhelming mathematicians, scientists and engineers to realize secure and efficient cryptographic algorithms. In this paper, a color image encryption algorithm combining the KAA map with multiple chaotic maps is proposed. The proposed algorithm makes full use of Shannon’s ideas of security, such that image encryption is carried out through bit confusion and diffusion. Confusion is carried out through employing 2 encryption keys. The first key is generated from the 2D Logistic Sine map and a Linear Congruential Generator, while the second key is generated from the Tent map and the Bernoulli map. Diffusion is attained through the use of the KAA map. An elaborate mathematical analysis is carried out to showcase the robustness and efficiency of the proposed algorithm, as well as its resistance to visual, statistical, differential and brute-force attacks. Moreover, the proposed image encryption algorithm is also shown to successfully pass all the tests of the NIST SP 800 suite.

Improved Video Steganography with Dual Cover Medium, DNA and燙omplex燜rames

The most valuable resource on the planet is no longer oil, but data. The transmission of this data securely over the internet is another challenge that comes with its ever-increasing value. In order to transmit sensitive information securely, researchers are combining robust cryptography and steganographic approaches. The objective of this research is to introduce a more secure method of video steganography by using Deoxyribonucleic acid (DNA) for embedding encrypted data and an intelligent frame selection algorithm to improve video imperceptibility. In the previous approach, DNA was used only for frame selection. If this DNA is compromised, then our frames with the hidden and unencrypted data will be exposed. Moreover the frame selected in this way were random frames, and no consideration was made to the contents of frames. Hiding data in this way introduces visible artifacts in video. In the proposed approach rather than using DNA for frame selection we have created a fake DNA out of our data and then embedded it in a video file on intelligently selected frames called the complex frames. Using chaotic maps and linear congruential generators, a unique pixel set is selected each time only from the identified complex frames, and encrypted data is embedded in these random locations. Experimental results demonstrate that the proposed technique shows minimum degradation of the stenographic video hence reducing the very first chances of visual surveillance. Further, the selection of complex frames for embedding and creation of a fake DNA as proposed in this research have higher peak signal-to-noise ratio (PSNR) and reduced mean squared error (MSE) values that indicate improved results. The proposed methodology has been implemented in Matlab.

RSA Cryptosystem Speed Security Enhancement (Hybrid and Parallel Domain Approach)

Encryption involves every aspect of working with and learning about codes. Over the last 40 years, it has grown in prominence to become a prominent scholarly discipline. Because most interactions now take place online, people require secure means of transmitting sensitive information. Several modern cryptosystems rely on public keys as a crucial component of their architecture. The major purpose of this research is to improve the speed and security of the RSA algorithm. By employing Linear Congruential Generator (LCG) random standards for randomly generating a list of large primes; and by employing other selected algorithms, such as the Chinese Remainder Theorem (CRT) in decryption, exponent selection conditions, the Fast Exponentiation Algorithm for encryption, and finally, a comparison of the enhanced RSA versus the normal RSA algorithm that shows an improvement will be provided.

An efficient mechanism using IoT and wireless communication for smart farming

IoT sensors are able to aggregate data regarding their agriculture field in real time have given rise to the concept of smart farming. The agricultural sector is of great importance to fulfill food resources need of the country. Most industries, including “smart agriculture,” have been completely redone in light of new internet-of-things (IoT) technologies that brought in new quantitative approaches. Such revolutionary changes are upending traditional agricultural practices and presenting new opportunities in the face of a variety of challenges. Agricultural applications involving wireless sensors and IoT devices are analyzed in detail. For agriculture-specific use, such as soil grounding, harvest position, irrigation, bug & insect discovery, a list of available sensors is provided. In this article, we proposed a WSN framework based on the Internet of Things for use in smart agriculture, with different design levels to choose from. The first step is having sensors on the farm which are capable of collecting relevant data and determining the appropriate cluster heads. In addition, the signal strength on the communication link is calculated by means of the signal to noise ratio (SNR) in order to attain reliable and competent information diffusion over long distances. Second, the recurrence of the linear congruential generator is used to ensure the security of information spread as of agricultural sensors to base stations (BS) by means of the linear congruential producer. Comparing the proposed framework to other solutions, the simulation results showed that it significantly improved communiqué routine by standard of 16.3 percent in system throughput, 36.3 percent in packet drop ratio, 12.4 percent in network latency, 18 percent in energy consumption, and 19 percent in routing overheads.

GENERATION OF PSEUDORANDOM SEQUENCES ON MICROCONTROLLERS WITH LIMITED COMPUTATIONAL RESOURCES, ENTROPY SOURCES, AND STATISTICAL PROPERTIES TESTING

Traditional encryption algorithms cannot be implemented on Internet of Things (IoT) devices due to their constrained computational resources. This necessitates the search and development of cryptographic solutions for securing data processed and transmitted by such devices. When encrypting data on devices with limited computational resources, simple encryption algorithms based on elementary bitwise operations, such as bitwise modulo-2 addition (XOR), can be utilized since these operations execute in a single processor cycle and do not require complex computations. However, a drawback of such operations is their invertibility—knowing the encryption key enables easy decryption by applying the same operation to the ciphertext. Ensuring the reliability of such ciphers requires continuous generation of random encryption keys.This work explores the functionality of the linear congruential method for generating sequences of random numbers. Several entropy sources available on microcontrollers are presented for the initial generator value, along with proposed algorithms for collecting initial data from these sources. The use of noise from unconnected pins of the analog-to-digital converter is suggested as the primary entropy source, while the uninitialized area of the microcontroller’s random-access memory serves as an additional source. A method for generating random sequences using the specified entropy sources is implemented and the algorithm’s performance is evaluated, specifically the key characteristic—randomness of the encryption key. The NIST STS 800-22 test suite is employed for evaluation. In all tests, the random sequence generation algorithm demonstrated results confirming the hypothesis that the sequence can be considered random.