Group Factorizations and Information Theory

@article{Tamm2007GroupFA,
  title={Group Factorizations and Information Theory},
  author={Ulrich Tamm},
  journal={2007 Information Theory and Applications Workshop},
  year={2007},
  pages={384-387}
}
  • U. Tamm
  • Published 22 October 2007
  • Computer Science
  • 2007 Information Theory and Applications Workshop
A factorization of a group G is a collection of subsets (A<sub>1</sub>, A<sub>2</sub>,...,A<sub>r</sub>) such that every element g isin G has a unique representation g =a<sub>1</sub>ldr a<sub>2</sub>ldr...ldra<sub>r</sub> where a<sub>1</sub> isin A<sub>i</sub> for i = 1,..., r. We shall survey several applications of group factorizations in information theory. They occur in the analysis of syndromes of integer codes, several graphs with large girth important for LDPC codes can be constructed… 
Some Results in Group-Based Cryptography
TLDR
This thesis adds to the cryptanalytic literature by demonstrating the insecurity of several group-based cryptosystems by cryptanalyse several key establishment protocols based on matrix groups.

References

SHOWING 1-10 OF 46 REFERENCES
Factorizations in the elementary Abelian p-group and their cryptographic significance
TLDR
Using the result that certain types of factorizations in the elementary abelian p-group are necessarily transversal (a term introduced by Magliveras), this paper shows that the public-key system proposed by Webb is insecure.
On Minimal Length Factorizations of Finite Groups
TLDR
This work proves the existence of such factorizations for several classical groups and—in parts by direct computation—for all groups of order <175560 (= ord(J 1), where J 1 is Janko's first sporadic simple group).
On perfectt-shift codes in abelian groups
TLDR
Finite abelian groups in which there exists a perfectt-shift code are determined, and the sphere packing bound: 2t|X|+1≤|G| holds for anyt- shift codeX.
Group factorizations in cryptography
TLDR
An elementary proof that factoring with respect to an (s, r)-mesh is at least as hard as the discrete logarithm problem is given, and a thorough analysis of several transformations that can be performed onlogarithmic signatures are provided.
Splittings of Cyclic Groups and Perfect Shift Codes
  • U. Tamm
  • Physics, Computer Science
    IEEE Trans. Inf. Theory
  • 1998
TLDR
It can be shown that splittings of Z/ sub p/ exist exactly if Z/sub p/ is also split by {1,2,3} and it is shown that the new conditions on the existence of perfect 3- and 4-shift codes exist.
Algebraic properties of cryptosystem PGM
TLDR
It is shown that the set of PGM transformations ℐG is not closed under functional composition and hence not a group, which is one of the strongest security conditions that can be offered by a private-key encryption system.
Graphs with Special Arcs and Cryptography
TLDR
The quality of an encryption in the case of graphs of high girth will be studied by comparing the probability to guess the message at random with the probability of breaking the key, i.e. guessing the encoding arc.
ON GENERATION OF RANDOM COVERS FOR FINITE GROUPS
  • T. Trung
  • Mathematics, Computer Science
  • 2006
TLDR
This paper shows the connection between this problem and the classical occupancy problem, and can solve the problem of generating random covers for arbitrarily large finite groups completely.
The cryptanalysis of a public-key implementation of finite group mappings
TLDR
A generalized (basis-independent) decryption algorithm is given, which shows that there are many equivalent private keys, and a method of efficiently obtaining such an equivalent private key is given; the FGM cryptosystem is rendered insecure.
Perfect (d, k)-codes capable of correcting single peak-shifts
Codes for the multibit peak-shift recording channel, called (d,k)-codes of reduced length N, are considered. Arbitrary (d,k)- and perfect (d,k)-codes capable of correcting single peak-shifts of given
...
...