History

Please fill in your query. A complete syntax description you will find on the General Help page.
Factorizations in the elementary abelian $p$-group and their cryptographic significance. (English)
J. Cryptology 7, No.4, 201-212 (1994).
Let $G$ be a finite abelian group, and let $A_i$ be a subset with at least two elements (for $i=1,\dots,s$). The ordered collection ${\bold A}=(A_1,\dots,A_s)$ is called a factorization of $G$ if and only if each group element may be written uniquely as a product of the form $a_1\dots a_s$ with $a_i\in A_i$ for $i=1,\dots,s$. Trivially, one obtains an example from each chain \$\{0\}=G_s<\dots Reviewer: D.Jungnickel (Augsburg)