Breadcrumb

 
 

Application of sieve methods to factorization and the discrete logarithm problem

Title:

Application of sieve methods to factorization and the discrete logarithm problem

Khalil, Antoine (2002) Application of sieve methods to factorization and the discrete logarithm problem. Masters thesis, Concordia University.

[img]
Preview
PDF
1718Kb

Abstract

Factoring large numbers and computing discrete logarithms are presumed to be hard problems. No polynomial time solution for those problem has yet been found. Those problems have many significant applications, particularly in cryptography. Several cryptosystems base their security on their supposed difficulty. In this thesis we present some of the algorithms to solve these two problems. We mainly explore sieving as a tool for that purpose. Among other material we describe the Quadratic Sieve and the Number Field Sieve as they apply to factoring. We finally sketch how the Number Field Sieve can be applied to compute discrete logarithms.

Divisions:Concordia University > Faculty of Arts and Science > Mathematics and Statistics
Item Type:Thesis (Masters)
Authors:Khalil, Antoine
Pagination:vi, 70 leaves ; 29 cm.
Institution:Concordia University
Degree Name:Theses (M.Sc.)
Program:Mathematics and Statistics
Date:2002
Thesis Supervisor(s):Ford, David
ID Code:1820
Deposited By:Concordia University Libraries
Deposited On:27 Aug 2009 13:22
Last Modified:08 Dec 2010 10:23
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Document Downloads

More statistics for this item...

Concordia University - Footer