The theory of finite simple groups is a (rather unexplored) area likely to provide interesting
computational problems and modeling tools useful in a cryptographic context. In this note …

Cryptanalysis of the MST 3 public key cryptosystem Page 1 cO de Gruyter 2009 J. Math. Crypt.
3 (2009), 321–338 DOI 10.1515 / JMC.2009.020 Cryptanalysis of the MST3 public key …

Logarithmic signaturesare a special type of group factorizations, introduced as basic
components of certain cryptographic keys. Thus, short logarithmic signatures are of special …

A logarithmic signature (LS) for a finite group G is an ordered tuple α= A 1, A 2,..., A n of
subsets A i of G, such that every element g ∈ G can be expressed uniquely as a product g …

Group-based cryptography is concerned with the role of nonabelian groups in cryptography.
Since its origins in the 1980s, there have been numerous cryptographic proposals based on …

This paper is a guide for the pure mathematician who would like to know more about
cryptography based on group theory. The paper gives a brief overview of the subject, and …

As special types of factorization of finite groups, logarithmic signature and cover have been
used as the main components of cryptographic keys for secret key cryptosystems such as …

In this paper, we study the recently proposed encryption scheme MST 3, focusing on a
concrete instantiation using Suzuki-2-groups. In a passive scenario, we argue that the one …

In this paper, we introduce a kind of decomposition of a finite group called a uniform group
factorization, as a generalization of exact factorizations of a finite group. A group G is said to …

Nonabelian group-based public key cryptography is a relatively new and exciting research
field. Rapidly increasing computing power and the futurity quantum computers [52] that have …