Conference ProceedingsOPEN ACCESS

Weaknesses of a public-key cryptosystem based on factorizations of finite groups

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 765 LNCS 50-54
DOI: 10.1007/3-540-48285-7_5
2Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Recently, Qu and Vanstone have announced the construction of several new public-key cryptosystems based on group factorization. One of these was described at the last AUSCRYPT meeting [2]. We point out a serious weakness of this last system which makes it insecure. Our method only uses elementary algebra.

Cite

CITATION STYLE

APA

Blackburn, S., Murphy, S., & Stern, J. (1994). Weaknesses of a public-key cryptosystem based on factorizations of finite groups. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 765 LNCS, pp. 50–54). Springer Verlag. https://doi.org/10.1007/3-540-48285-7_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free