On generation of random covers for finite groups

MaRDI QIDQ5445487zbMATH OpenFDO

Authors Pavol Svaba, Tran van Trung

Publication date 5 March 2008

zbMATH Keywords

finite grouppublic-key cryptosystemlogarithmic signatureuniform cover\([r, s\)-mesh]

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Pseudorandom number generators based on random covers for finite groups
• On the distribution of the elements of a finite group generated by covers
• Generating random elements in finite groups.
• Using Poly-Dragon cryptosystem in a pseudorandom number generator MSTg
• A public key cryptosystem based on non-abelian finite groups

Cited in

(8)

• Recent Advances in Constraints
• A note on the security of \(\text{MST} _{3}\)
• Pseudorandom number generators based on random covers for finite groups
• On the distribution of the elements of a finite group generated by covers
• All exceptional groups of Lie type have minimal logarithmic signatures
• Pseudorandom Generators Based on Subcovers for Finite Groups
• Logarithmic signatures for abelian groups and their factorization
• Minimal logarithmic signatures for the unitary group \(U_n(q)\)

This page was built for publication: On generation of random covers for finite groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445487)