Pseudorandom number generators based on random covers for finite groups

DOI10.1007/s10623-011-9485-1zbMath1347.65009OpenAlexW2060033176MaRDI QIDQ420634

Pavol Svaba, Pascal Marquardt, Tran van Trung

Publication date: 22 May 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-011-9485-1

zbMATH Keywords

finite grouppseudorandom number generatorrandom coverstatistical test of randomness

Mathematics Subject Classification ID

Cryptography (94A60) Random number generation in numerical analysis (65C10) Abstract finite groups (20D99)

Related Items (5)

Minimal logarithmic signatures for one type of classical groups ⋮ Construction of strongly aperiodic logarithmic signatures ⋮ A method for analyzing repetitive pseudorandom sequences by the criterion of Markov chain entropy ⋮ Minimal logarithmic signatures for the unitary group \(U_n(q)\) ⋮ LOGARITHMIC SIGNATURES FOR ABELIAN GROUPS AND THEIR FACTORIZATION

Uses Software

• MersenneTwister
• Diehard
• NIST Statistical Test Suite

Cites Work

• A public key cryptosystem based on non-abelian finite groups
• New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
• Public key cryptosystem MST3: cryptanalysis and realization
• A Simple Unpredictable Pseudo-Random Number Generator
• A new random number generator from permutation groups
• Mersenne twister
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pseudorandom number generators based on random covers for finite groups