Minimum length key in MST cryptosystems

Haibo Hong

doi:10.1007/s11432-015-5479-3

Minimum length key in MST cryptosystems

2016-09-13

2

PRE

AI

DOI：10.1007/s11432-015-5479-3

Original

Original request for help

Save

Abstract

En 中文

As a special factorization category of finite groups, logarithmic signature ( LS) is used as the main component of cryptographic keys that operate within secret key cryptosystems such as PGM and public key cryptosystems like MST1, MST2 and MST3. An LS with the shortest length is called a minimal logarithmic signature (MLS) that constitutes of the smallest sized blocks and offers the lowest complexity, and is therefore desirable for cryptographic constructions. However, the existence of MLSs for finite groups should be firstly taken into an account. The MLS conjecture states that every finite simple group has an MLS. If it holds, then by the consequence of Jordan- Holder Theorem, every finite group would have an MLS. In fact, many cryptographers and mathematicians are keen for solving this problem. Some effective work has already been done in search of MLSs for finite groups. Recently, we have made some progress towards searching a minimal length key for MST cryptosystems and presented a theoretical proof of MLS conjecture.

Keywords:

MLS conjecture

finite groups

(minimal) logarithmic signature

minimum length key

MST cryptosystems

Minimum length key in MST cryptosystems

Abstract

AI Summary

Journal

Organization