Inverse factorisation method in cryptography

Oliveira, Roman A. de (2009) Inverse factorisation method in cryptography. BSc dissertation, University of Portsmouth.

[img] PDF
Restricted to Registered users only

Download (2165kB)


    The objective of this project was to create a software relative to cryptography and to factorisation. It led to the creation of a new algorithm which can be use to factorise composite numbers (products of at least two prime numbers together). In this report, several encryptions will be presented as an introduction to ancient and modern cryptography. These encryptions will be compared and analysed in an efficient point of view. The main part of this paper will be based on a new algorithm created for this project called Inverse Factorisation Method (IFM). Going though the factorisation of numbers, and the different complexity classes, it will be shown how this factorisation algorithm differs from the others already in use by his novelty and originality. It will be shown as well that the IFM is used to factorise any positive number but his efficiency is essentially related to the factorisation of biprime numbers used in the Rivest-Shamir-Adleman (RSA) encryption.

    Item Type: Dissertation
    Departments/Research Groups: Faculty of Technology > School of Computing
    Depositing User: Jane Polwin
    Date Deposited: 20 Jan 2011 12:48
    Last Modified: 28 Jan 2015 11:15

    Actions (login required)

    View Item

    Document Downloads

    More statistics for this item...