Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 14 of 14 for “"Number Field Sieve"”.

  1. Number Field Sieve with provable complexity

    … we give an in-depth introduction to the General Number Field Sieve, as it was used by Buhler, Lenstra, and Pomerance, [17], before looking at one of the modern developments of this algorithm: A randomized version with provable complexity. This version was posited in 2017 by Lee and Venkatesan, …

    bristol Repository record for Number Field Sieve with provable complexity (opens in a new tab) Download PDF for Number Field Sieve with provable complexity (opens in a new tab)

  2. Polynomial selection for the number field sieve

    The number field sieve is asymptotically the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The running time of subsequent steps depends on the quality of the chosen polynomials. In the thesis, we discuss the …

    anu Repository record for Polynomial selection for the number field sieve (opens in a new tab)

  3. Mathematical Background of the Special Number Field Sieve

    The number field sieve (NFS), first formulated by John Pollard in 1988 to factor Fermat and Cunningham numbers, has since been adapted to work for general composites. In this paper, we examine the earliest form of number field sieve, now classified as special number field sieve (SNFS). We first …

    ku Repository record for Mathematical Background of the Special Number Field Sieve (opens in a new tab)

  4. An Introduction to the General Number Field Sieve

    … the RSA system would be nullified. The General Number Field Sieve algorithm is the fastest known method for factoring large integers. Research and development of this algorithm within the past five years has facilitated factorizations of integers that were once speculated to require thousands of …

    vt Repository record for An Introduction to the General Number Field Sieve (opens in a new tab)

  5. The Number Field Sieve for Barreto-Naehrig Curves: Smoothness of Norms

    … the discrete logarithm problem (DLP) in finite fields of medium characteristic. The number field sieve is the best known algorithm for this problem. We look at a recent improvement to the number field sieve (NFS) by Joux and Pierrot that applies to finite field DLPs arising from elliptic curves …

    waterloo Repository record for The Number Field Sieve for Barreto-Naehrig Curves: Smoothness of Norms (opens in a new tab)

  6. Application of sieve methods to factorization and the discrete logarithm problem

    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 …

    concordia Download PDF for Application of sieve methods to factorization and the discrete logarithm problem (opens in a new tab)

  7. Factorization

    … most efficient algorithms which are quadratic sieve and number field sieve. Background information such as definitions and theorems are given to help understand the concepts behind each method.

    csusb Repository record for Factorization (opens in a new tab)

  8. Factorization

    … most efficient algorithms which are quadratic sieve and number field sieve. Background information such as definitions and theorems are given to help understand the concepts behind each method.

    csusb-retro Repository record for Factorization (opens in a new tab)

  9. Computing Class Groups of Cubic Orders Using Kleinjung’s Sieving Method

    … in the computation of class groups of orders of number fields using Buchmann’s index calculus method. In particular, we focus on primitive cubic orders. The first is an adaptation of the homogeneous method from the number field sieve to compute the class groups of a special class of orders known …

    calgary Repository record for Computing Class Groups of Cubic Orders Using Kleinjung’s Sieving Method (opens in a new tab)

  10. An investigation on Integer Factorization applied to Public Key Cryptography

    … of the most famous: given a composite integer number, recovering its factors is commonly believed to be hard (worst-case complexity). In this thesis, after a brief explaination of the developments on integer factorization and a description of the General Number Field Sieve (GNFS), we will …

    trento Repository record for An investigation on Integer Factorization applied to Public Key Cryptography (opens in a new tab) Restricted access

  11. Constructing suitable parameters for pairing-based cryptography

    … abelian vari- eties defined over a finite field. In order for these abelian varieties to be suitable for implementations, it is required that they have a small embedding degree and a large prime order subgroup. Such abelian varieties are called “pairing-friendly”.This dissertation is …

    greece Repository record for Constructing suitable parameters for pairing-based cryptography (opens in a new tab)

  12. Hardware and software development for the efficient mapping of mathematical problems on field programmable gate array systems

    … market risk and lowers the chance of success. Field Programmable Gate Arrays (FPGAs) offer a low-risk, quick time-to-market solution that industrial designers can easily modify when they need to make changes, fix bugs or create product derivatives at some point in the future. However, power …

    greece Repository record for Hardware and software development for the efficient mapping of mathematical problems on field programmable gate array systems (opens in a new tab)

  13. Integer Factorization on the GPU

    Tato práce pojednává o faktorizaci, tedy rozkladu složených čísel na prvočísla a možnostech její paralelizace. Dále shrnuje nejznámější algoritmy pro faktorizaci a nejznámější platformy pro implementaci těchto algoritmů na grafické kartě. Hlavní část práce se zaobírá návrhem a implementací …

    brno-tech Repository record for Integer Factorization on the GPU (opens in a new tab)