Title

An analysis of public key cryptosystems

Document Type

Conference Proceeding

Faculty

Faculty of Computing, Health and Science

School

School of Computer and Information Science

RAS ID

1280

Comments

Bani Hammad, Y.M. (2002). An analysis of public key cryptosystems. In: Hutchinson, W. (Ed.). Protecting the infrastructure: 3rd Australian information warfare & security conference 2002. Churchlands, Australia: We-B Centre, School of Management Information Systems, School of Computer & Information Sciences, Edith Cowan University.

Abstract

The research is based on analysis of public key c1yptosystems. There are various public key systems that, in the past 25 years, have been designed with security, which depends on the difficulty of factoring large numbers. These include the RSA algorithm, Okamoto-Uchiyama, MultiPrime, etc. To date most factoring methods have been applied to numbers, which are the product of two primes. Recently, there have been several new public key algorithms proposed whose underlying modulus is the product of more than two primes. The aim of this research is to conduct an in depth analysis of methods of factoring such numbers.

 
COinS