Factorizable logarithmic signatures for finite groups are the essential componentof the cryptosystems MST1 and MST3. The problem of finding efficient algorithmsfor factoring group elements with respect to a given class of logarithmic signatures istherefore of vital importance in the investigation of these cryptosystems. In this paperwe are concerned about the factorization algorithms with respect to transversal andfused transversal logarithmic signatures for finite abelian groups. More precisely wepresent algorithms and their complexity for factoring group elements with respect tothese classes of logarithmic signatures. In particular, we show a factoring algorithm withrespect to the class of fused transversal logarithmic signatures and also its complexitybased on an idea of Blackburn, Cid and Mullan for finite abelian groups.
@article{238,
title = {Logarithmic signatures for abelian groups and their factorization},
journal = {Tatra Mountains Mathematical Publications},
volume = {55},
year = {2013},
doi = {10.2478/tatra.v57i0.238},
language = {EN},
url = {http://dml.mathdoc.fr/item/238}
}
Svaba, Pavol; Trung, Tran van; Wolf, Paul. Logarithmic signatures for abelian groups and their factorization. Tatra Mountains Mathematical Publications, Tome 55 (2013) . doi : 10.2478/tatra.v57i0.238. http://gdmltest.u-ga.fr/item/238/