Linear Congruential Generator Research Articles

IMPLEMENTATION OF LINEAR CONGRUENT METHOD (LCM) ALGORITHM AS A TRAFFICER FOR FAHMIL QUR’AN

Fahmil Qur'an is one of the branches of the Musabaqah Tilawatil Qur'an (MTQ) race. In the Fahmil Quran race, the participants will be given a package of questions - questions that will be tested by the participants' ability to work together when answering questions given by the jury. And the package of questions that are available is printed poorly, allowing the jury to misrepresent the participants. To avoid repetition in giving questions to participants, a system will be built that is able to randomize the questions automatically. Randomizing the question uses a linear congruent method algorithm. In this research there is a system flowchart and manual calculation of the linear congruent method algorithm.

Secure Processing of Stream Cipher Encrypted Data Issued from IOT: Application to a Connected Knee Prosthesis.

In this paper, we propose a secure protocol that allows processing encrypted data emitted by a medical IOT device. Its originality stands on a new fast algorithm which makes possible the conversion of Combined Linear Congruential Generator (CLCG) encrypted data into data homomorphically encrypted with the Damgard-Jurik (D-J) cryptosystem. By doing so, an honest-but-curious third party, like a smartphone, can process data issued from the IOT devices (e.g. raising a health alert) without endangering data privacy while CLCG can be integrated in an IOT of low computation capabilities. Moreover, in order to reduce communication and computation complexities compared to existing solutions and to achieve a real time solution, we further propose a secure packed version of CLCG in the D-J domain. With it a medical IOT can encrypt several pieces of data at once while allowing a third party to independently convert and process them in their D-J homomorphic encrypted form. We theoretically and experimentally demonstrate the performance of our solution in the case of a connected knee prosthesis, the data of which are processed for patient monitoring.

Use of Algorithm Linear Congruential Generator (LCG) on the TOEFL Test Application

English as one of the languages most used by the world’s population to communicate. The English language proficiency testing model for one of them is the TOEFL (Test of English as Foreign Language). TOEFL is intended as a measuring tool or evaluation of a person’s ability to understand English. The use of internet technology advances in developing TOEFL learning media can provide other alternatives in studying the TOEFL. The existence of this website is expected to provide various facilities for the public, especially internet users in studying the TOEFL, so that the TOEFL is no longer an obstacle and can encourage someone’s interest in learning English. The web-based TOEFL application system can provide all types of information needed as well as the process of listing examinees, recapitating participant data and printing certificates in a structured manner. The method used in this application to scramble the problem is the Linear Congruential Generator (LCG) method which can produce a series of pseudo random numbers based on several adjusted repetitions.

Analysis and Design Computerized Semester Exams by Randomization Order of The Questions with Linear Congruential Generator Methods (Study Case : Agathos Vocational High School)

In this modern era, education begin to use more advanced technology in order to ease their activities such as semester exams. By taking advantage of computer technology in education will make semester exams become simpler during the process of the exam and scoring, as in shuffling the order of the question and scoring become faster and more accurate. Currently, Agathos Vocational High School still use manual exam system, and the process cost is high. They have to print out the test and answer paper, undisciplined students can cheating during exam, mistakes during marking the test, and unorganized archives when filing the student’s results. After finding out the current system in Agathos Vocational High School, To solving their current problems is develop a system that will organize the information electronically in filling the student’s grades and making a random order of questions, using Linear Congruential Generator (LCG) method. This computerized system will help the teachers to making the questions with inputting process, and will be done in three days, marking the answers and filling the grade are automatically done by system, then print it out to be Student’s Report. With using LCG method, can motivating the students to study as the order of the question is randomized by Student’s ID Number, the students will not be able to continue filling their answers after the time is up and this will reducing the possibility of cheating. The time needed to prepare exam questions was reduced from 8 days to 1 day. The system test results is 64% can be accepted by the user.

Linear Congruential Method for Randomization of Test Item in Computer-Based Psychological Edwards Personal Preference Schedule (EPPS) Test

Psychological tests are used to determine human’s attitude and behavior. In its application, psychological tests still use the old method. Objects are asked to answer questions and then the answers will be collected again to be calculated, and then conclusion will be drawn from the result. It will be time consuming and impractical. Computer-based psychological test have an answer to these deficiencies. By utilizing the ease of test item management in computer, this paper discusses the application of linear congruential method for randomization of test item in computer-based psychological edwards personal preference schedule (EPPS) test developed by web-based programming. According to expert, the difference in the number of respondents who have the largest and smallest raw score aspects that are the same and not the same is considered not too significant that in this case randomization of test item can be applied to the EPPS test because the change in test results is not too significant and the scoring process is still valid

Steganografi Citra Menggunakan Metode Least Significant Bit (LSB) dan Linear Congruential Generator (LCG)

Steganografi merupakan sebuah cara yang digunakan untuk menyembunyi-kan pesan rahasia dari orang yang tidak berhak mengetahuinya. Pada penelitian ini penulis menggunakan salah satu metode steganografi yaitu metode least significant bit (LSB) untuk menyisipkan bit-bit pesan rahasia berupa teks kedalam citra digital RGB berekstensi file bitmap, dengan cara menggabungkan metode LSB dan linear congruential generator (LCG) untuk membangkitkan bilangan acak dari posisi pixel yang akan disisipkan pesan rahasia. Hasil dari penelitian ini penulis berhasil membangun aplikasi steganografi dengan bahasa pemrograman java dan menguji kualitas stego image yang menghasilkan nilai rata-rata Peak Signal to Noise Ratio (PSNR) yang mencapai 51 dB. Dari penilaian ini, disimpulkan bahwa stego image yang dihasilkan dalam kualitas baik dan tidak mengalami perubahan yang signifikan.

Modified Dual-CLCG Method and its VLSI Architecture for Pseudorandom Bit Generation

Pseudorandom bit generator (PRBG) is an essential component for securing data during transmission and storage in various cryptography applications. Among popular existing PRBG methods such as linear feedback shift register (LFSR), linear congruential generator (LCG), coupled LCG (CLCG), and dual-coupled LCG (dual-CLCG), the latter proves to be more secure. This method relies on the inequality comparisons that lead to generating pseudorandom bit at a non-uniform time interval. Hence, a new architecture of the existing dual-CLCG method is developed that generates pseudo-random bit at uniform clock rate. However, this architecture experiences several drawbacks such as excessive memory usage and high-initial clock latency, and fails to achieve the maximum length sequence. Therefore, a new PRBG method called as “modified dual-CLCG” and its very large-scale integration (VLSI) architecture are proposed in this paper to mitigate the aforesaid problems. The novel contribution of the proposed PRBG method is to generate pseudorandom bit at uniform clock rate with one initial clock delay and minimum hardware complexity. Moreover, the proposed PRBG method passes all the 15 benchmark tests of NIST standard and achieves the maximal period of $2^{n}$ . The proposed architecture is implemented using Verilog-HDL and prototyped on the commercially available FPGA device.

Performance Comparison of Linear Congruent Method and Fisher-Yates Shuffle for Data Randomization

Linear Congruent Method (LCM) and Fisher-Yates Shuffle Algorithms are widely known and used in various fields and needs. Both of these algorithms are used because of their advantage and are used for data randomization needs. There have been many studies using these algorithms, but it is not known which algorithm performance is better. In this study, performance comparison testing was carried out in the form of speed testing based on the amount of randomized data. The amount of randomized data varies from 10 to 25,000 data. The tests performed are displayed in tables and graphs. The results obtained, Fisher-Yates algorithm 11.768% faster than LCM.

Fast Random Integer Generation in an Interval

In simulations, probabilistic algorithms, and statistical tests, we often generate random integers in an interval (e.g., [0, s )). For example, random integers in an interval are essential to the Fisher-Yates random shuffle. Consequently, popular languages such as Java, Python, C++, Swift and Go include ranged random integer generation functions as part of their runtime libraries. Pseudo-random values are usually generated in words of a fixed number of bits (e.g., 32b, 64b) using algorithms such as a linear congruential generator. We need functions to convert such random words to random integers in an interval ([0, s )) without introducing statistical biases. The standard functions in programming languages such as Java involve integer divisions. Unfortunately, division instructions are relatively expensive. We review an unbiased function to generate ranged integers from a source of random words that avoids integer divisions with high probability. To establish the practical usefulness of the approach, we show that this algorithm can multiply the speed of unbiased random shuffling on x64 processors. Our proposed approach has been adopted by the Go language for its implementation of the shuffle function.

Minimising the makespan in open shop scheduling problems using variants of discrete firefly algorithm

Minimising makespan in open shop scheduling problem is the aim of this research work. The scheduling problems consist of 'n' jobs and 'm' machines, in which each job has 'O' operations. The processing time for 50 open shop scheduling problems was generated using a linear congruential random number generator. A non-traditional algorithm called discrete firefly algorithm is proposed to minimise the makespan of open shop scheduling problems and this method is referred as A1. Discrete firefly algorithm is also hybridised along with other heuristic algorithms in two ways: 1) firefly algorithm is hybridised with longest total remaining processing on other machines and local search algorithms which is referred as A2; 2) firefly algorithm is hybridised with simulated annealing and referred as A3. Novelty of this work focuses on the application of open shop scheduling problems in quality control of a production industry.

Spectral Analysis of the MIXMAX Random Number Generators

We study the lattice structure of random number generators of the MIXMAX family, a class of matrix linear congruential generators that produces a vector of random numbers at each step. The design of these generators was inspired by Kolmogorov K-systems over the unit torus in the real space, for which the transition function is measure preserving and produces a chaotic behavior. In actual implementations, however, the state space is a finite set of rational vectors, and the MIXMAX has a lattice structure just like linear congruential and multiple recursive generators. Its matrix entries were also selected in a special way to allow a fast implementation, and this has an impact on the lattice structure. We study this lattice structure for vectors of successive and nonsuccessive output values in various dimensions. We show in particular that for coordinates at specific lags not too far apart, in three dimensions, or if we construct points of k+2 or more successive values from the beginning of an output vector of size k, all the nonzero points lie in only two hyperplanes. This is reminiscent of the behavior of lagged-Fibonacci and add-with-carry/subtract-with-borrow generators. And even if we skip the output coordinates involved in this bad structure, other highly structured projections often remain, depending on the choice of parameters. We show that empirical statistical tests can easily detect this structure.

Penerapan Kriptografi RSA Dalam Mengamankan File Teks Berbasis PHP

Abstract - Along with the development of communication technology human needs in the use of technology are increasing, especially in data storage. One way to improve security for data is by using cryptographic methods. RSA Algorithm (Rivest Shamir Adleman) is one method in the branch of cryptography, where RSA is a type of asymmetric cryptography that uses 2 keys, namely public and private keys. The problem of increasing the security of the public key and private key in RSA (Rivest Shamir Adlema) is that the Linear Congruential Generator (LCG) method is needed, LCG is used to generate a set of random numbers to n, where a set of random numbers will be taken that have a number value prime. One method for generating prime numbers is The Sieve Of Eratosthenes algorithm, The Sieve Of Eratosthenes algorithm is a classic algorithm for determining all prime numbers until the n-number is specified. The way the The Sieve Of Eratosthenes method works is to eliminate numbers that are not prime numbers, resulting in a collection of prime numbers. The prime number generated by the The Sieve Of Eratosthenes algorithm will be used for the public key and private key in the RSA criterion. Keywords - RSA, LCG, The Sieve of Eratosthenes.

An Informational Test for Random Finite Strings.

In this paper, by extending some results of informational genomics, we present a new randomness test based on the empirical entropy of strings and some properties of the repeatability and unrepeatability of substrings of certain lengths. We give the theoretical motivations of our method and some experimental results of its application to a wide class of strings: decimal representations of real numbers, roulette outcomes, logistic maps, linear congruential generators, quantum measurements, natural language texts, and genomes. It will be evident that the evaluation of randomness resulting from our tests does not distinguish among the different sources of randomness (natural, or pseudo-casual).

Design and Implementation of LCG-Trivium Key Stream Generator into FPGA

<p>This paper presents the Design and implementation into Field ProgrammableGate Array (FPGA) of a combine stream cipher and a simple linear congruential generator circuit to produce key stream. The LCG circuit is used to produce initialization vector (IV) each 2<sup>64</sup> clock cycle to the cipher trivium in other to strengthen the complexity of the cipher to known attacks on trivium. The LCGTrivium is designed to generate 2<sup>144</sup> bits of keystream from an 80-bits secret and a variable 80-bits initial value. To implement the LCG-Trivium on FPGA, we use VHDL to build a simple LCG and Trivium and a state machine to synchronize the functioning of the LCG and Trivium. The number of gates, memory and speed requirement on FPGA is giving after analysis. The design is simulated, synthesized and implemented in Quartus II 10.1, ModelSim-Altera 6.5 and Cyclone IV E EP4CE115F29C7N.</p>

Design and Implementation of LCG-Trivium Key Stream Generator into FPGA

<p>This paper presents the Design and implementation into Field ProgrammableGate Array (FPGA) of a combine stream cipher and a simple linear congruential generator circuit to produce key stream. The LCG circuit is used to produce initialization vector (IV) each 2<sup>64</sup> clock cycle to the cipher trivium in other to strengthen the complexity of the cipher to known attacks on trivium. The LCGTrivium is designed to generate 2<sup>144</sup> bits of keystream from an 80-bits secret and a variable 80-bits initial value. To implement the LCG-Trivium on FPGA, we use VHDL to build a simple LCG and Trivium and a state machine to synchronize the functioning of the LCG and Trivium. The number of gates, memory and speed requirement on FPGA is giving after analysis. The design is simulated, synthesized and implemented in Quartus II 10.1, ModelSim-Altera 6.5 and Cyclone IV E EP4CE115F29C7N.</p>

FPGA Implementation of Linear Congruential Generator Based on Block Reduction Technique

This paper exposes circuit design of linear congruential generator (LCG) and implementation in FPGA based on block reduction technique. The circuit is derived from LCG algorithm proposed by Lehmer. Block reduction technique has been used to simplify the circuit. Several net connections among the blocks of the circuit are ignored or disconnected and the multiplier is replaced by a shifter. Simulations of both behavior and timing have been done and the results confirm its algorithm. The Cyclone II EP2C8Q208C8N and Cyclone IV E EP4CE115F29C7N of Altera have been chosen to extract comparison data of speed and occupied area. Further comparison of shift technique and the wordlengths reduction technique has been made. In general, the proposed design is far simpler than the previous published LCG circuit.

Penerapan Linear Congruential Method pada Aplikasi Ujian Berbantuan Komputer

In order to obtain information regarding student learning outcomes, the test is one way to go. Both test orally and written test. Along with the development of technology, the current written test is no longer done on paper but done using computer media. Computer-based test is one of the exam types applied in the National Exam and have been implemented in some schools in Indonesia. In this exam, it is possible for students to work on different packages of problems with their colleagues on the side. This is possible because of the problem randomization method. Nevertheless, it should be tested whether in the randomization of the problem has noticed the sequence of occurrences of questions which is still pay attention to the sequence as Bloom Taxonomy. This study focuses on applying the Linear Congruential Method, in order to generate a random problem from the database. The method called Pseudorandom Number Generator. In practice, the Linear Congruential Method method use variables a, c, and m as inputs for the occurrence of random numbers simultaneously. In this study, the numbers a and m are set first. While the variable c obtained from random numbers generated in the previous stage. The result of this research is the computer-based test which applies for random numbers.

LINEAR CONGRUENT METHOD (LCM) IN TESTING SYSTEM USING CLIENT-SERVER MODEL

This study aims to apply the Linear Congruent Method (LCM) method using client-server test system, so as to minimize the weakness of examining process and the teacher's mistake in valuation that may occur. LCM method in this research was used to scramble questions data before testing and sent to the Client (Student) by the Server (Teacher) via a TCP/IP Socket. The system was designed through the VB.Net Programming Language. The results showed that by implementing LCM method in test system lead to 100% performance

Influence of Fracture Heterogeneity Using Linear Congruential Generator (LCG) on the Thermal Front Propagation in a Single Geothermal Fracture-Rock Matrix System

An implicit finite difference numerical model has been developed to investigate the influence of fracture heterogeneity on the propagation of thermal front in a single horizontal fracture-matrix system. Instead of depending on a complex and data-demanding geostatistical method for a precise representation of fracture aperture, a statistical linear congruential generator (LCG) method was applied in the present study to replicate the unpredictable nature of fracture aperture morphology. The results have been compared with the parallel plate model and simple sinusoidal model. Finally, sensitivity analysis of fracture aperture size and fluid flow rate has been carried out to identify the conditions at which fracture heterogeneity is critical. The results indicate that LCG-aperture enhances the heat transfer between fracture and hot rock matrix compared to the parallel and sinusoidal fractures. Further, the temperature profiles in hot rock indicate that there was a greater loss of heat for the case of LCG-aperture (25% loss) compared to sinusoidal (16%) and parallel plate (8%) apertures. It was found that heterogeneity does not play a major role at small fracture aperture size (≤50 μm) and at low flow rates. However, as fracture aperture size increases, the heterogeneity plays a vital part even at low flow rates.

A Comparison of One Time Pad Random Key Generation using Linear Congruential Generator and Quadratic Congruential Generator

One Time Pad algorithm always requires a pairing of the key for plaintext. If the length of keys less than a length of the plaintext, the key will be repeated until the length of the plaintext same with the length of the key. In this research, we use Linear Congruential Generator and Quadratic Congruential Generator for generating a random number. One Time Pad use a random number as a key for encryption and decryption process. Key will generate the first letter from the plaintext, we compare these two algorithms in terms of time speed encryption, and the result is a combination of OTP with LCG faster than the combination of OTP with QCG.