A Method of Constructing Quasigroup Field-Based Random Number Generators - Maple Application Center
Application Center Applications A Method of Constructing Quasigroup Field-Based Random Number Generators

A Method of Constructing Quasigroup Field-Based Random Number Generators

Author
: Czeslaw Koscielny
Engineering software solutions from Maplesoft
This Application runs in Maple. Don't have Maple? No problem!
 Try Maple free for 15 days!
The skill to produce satisfactory sequences of random numbers is one of the crucial tasks of cryptography. For this reason a lot of types of random number generators in the literature are described. Many of known and generally used random number generators are not excellent enough for modern cryptographic applications, so it's worth trying to develop new generators. It has been experimentally shown that there exist a lot of QFFSR sequences generators of diverse structure, many of them giving sequences of QF(q) elements with a good randomness. Therefore, the hard problem of optimizing QFFSR sequences generators has been indicated.

Application Details

Publish Date: December 05, 2003
Created In: Maple 9
Language: English

More Like This

Extended (24, 12) Binary Golay Code: Encoding and Decoding Procedures
2
Secure Symmetric-Key Block Cipher Based on Generalized Finite Fields
Exploring the Modified IDEA Using the topicIDEA Package
User-Friendly ElGamal Public-Key Encryption Scheme
Mersenne Primes-Based Symmetric-Key Masquerade Block Cipher
Maple Tools for Preliminary Cryptanalysis
Investigating the DES Properties Using the GenDES Package
The Application of Quasigroup Fields in Designing Efficient Hash Functions
Steganocryptography with Maple 8
topicIDEA Package
The MLA Steganography
Byte Oriented Synchronous Quasigroup Stream Cipher with a Huge Keyspace