Using Quasigroups for Generating Pseudorandom Numbers
Vinod Kumar Godavarty
TL;DR
This paper introduces a quasigroup-based algorithm for pseudorandom number generation, leveraging a pre-generated matrix, and evaluates its quality against established generators using Marsaglia's Diehard tests.
Contribution
It presents a novel quasigroup algorithm for pseudorandom numbers and compares its performance with existing generators using standard testing.
Findings
The quasigroup algorithm produces high-quality pseudorandom numbers.
Performance is comparable or superior to traditional generators in Diehard tests.
The method is suitable for secure communication applications.
Abstract
This paper presents an algorithm for generating pseudorandom numbers using quasigroups. Random numbers have several applications in the area of secure communication. The proposed algorithm uses a matrix of size n x n which is pre-generated and stored. The quality of random numbers generated is compared with other pseudorandom number generator using Marsaglia's Diehard battery of tests.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsChaos-based Image/Signal Encryption · Security in Wireless Sensor Networks · Biometric Identification and Security