Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Obstacles in two public key cryptosystems based on group factorizations

In: Tatra Mountains Mathematical Publications, vol. 25, no. 3
María Isabel Gonzále Vasco - Rainer Steinwandt
Detaily:
Rok, strany: 2002, 23 - 37
O článku:
Recently S. Magliveras, D. Stinson, and Tran Van Trung proposed two approaches for deriving a public key cryptosystem from the symmetric cipher PGM. The first proposal, $MST1$, uses the same kind of group factorizations as PGM (so-called logarithmic signatures), and the second one, $MST2$, makes use of a different kind called meshes. We point out security problems in $MST1$ and $MST2$ that arise if the keys are not chosen carefully enough. In fact, at the writing of this paper we are not aware of a practical method for deriving keys with acceptable security.
Ako citovať:
ISO 690:
Vasco, M., Steinwandt, R. 2002. Obstacles in two public key cryptosystems based on group factorizations. In Tatra Mountains Mathematical Publications, vol. 25, no.3, pp. 23-37. 1210-3195.

APA:
Vasco, M., Steinwandt, R. (2002). Obstacles in two public key cryptosystems based on group factorizations. Tatra Mountains Mathematical Publications, 25(3), 23-37. 1210-3195.