Papers
Topics
Authors
Recent
Search
2000 character limit reached

Minimal Logarithmic Signatures for one type of Classical Groups

Published 5 Jul 2015 in cs.CR | (1507.01163v1)

Abstract: As a special type of factorization of finite groups, logarithmic signature (LS) is used as the main component of cryptographic keys for secret key cryptosystems such as PGM and public key cryptosystems like MST1, MST2 and MST3. An LS with the shortest length, called a minimal logarithmic signature (MLS), is even desirable for cryptographic applications. The MLS conjecture states that every finite simple group has an MLS. Recently, the conjecture has been shown to be true for general linear groups GLn(q), special linear groups SLn(q), and symplectic groups Spn(q) with q a power of primes and for orthogonal groups On(q) with q as a power of 2. In this paper, we present new constructions of minimal logarithmic signatures for the orthogonal group On(q) and SOn(q) with q as a power of odd primes. Furthermore, we give constructions of MLSs for a type of classical groups projective commutator subgroup.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.