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 9 of 9 for “"Primality test"”.

  1. JACOBI SUM PRIMALITY TEST

    Many methods have already been developed to test the primality of a number. For instance, we have probabilistic methods like the Rabin-Miller test, methods involving special forms of N such that N - 1, N + 1 has a factorisation and finally almost deterministic methods (in the sense that if the …

    nus Repository record for JACOBI SUM PRIMALITY TEST (opens in a new tab) Download file for JACOBI SUM PRIMALITY TEST (opens in a new tab)

  2. Studying the efficiency of the Frobenius primality test

    … tell whether a given number is prime or not. To test whether a number is a prime number, we require a computationally efficient primality testing algorithm. The primary objective of my research is to evaluate how well the tests work. Especially, in my research our main focus is on Grantham’s …

    lethbridge Repository record for Studying the efficiency of the Frobenius primality test (opens in a new tab)

  3. On cyclotomic primality tests

    … and R. Rumely invented the first cyclotomicprimality test, and shortly after, in 1981, a simplified and more efficient versionwas presented by H.W. Lenstra for the Bourbaki Seminar. Later, in 2008, ReneSchoof presented an updated version of Lenstra's primality test. This thesis presents …

    ut-knoxville Repository record for On cyclotomic primality tests (opens in a new tab)

  4. The other side of Mersenne Primes

    … Chapter 3 presents the famed Lucas-Lehmer primality test, along with proofs. Chapter 4 presents a collection of enrichment modules, catered to highschoolers, maths enthusiasts, and crafters, that I have developed during my study. Chapter 5 closes with thoughts on further explorations, and …

    kent Download PDF for The other side of Mersenne Primes (opens in a new tab)

  5. On Solving Univariate Polynomial Equations over Finite Fields and Some Related Problems

    … interested in include finite field arithmetic, primality testing, and elliptic curve arithmetic. We first present a novel idea to compute square roots over some families of finite fields. Our square root algorithm is deterministic polynomial-time and can be proved by elementary means. The …

    maryland Repository record for On Solving Univariate Polynomial Equations over Finite Fields and Some Related Problems (opens in a new tab)

  6. Applications of Fourier coefficients of modular forms

    … that uses an oracle that outputs af(n) for testing the squarefree-ness of an integer. This algorithm exploits the greatest common divisor of sequences of the form (af(pr)) r∈A where p is a prime and A ⊂ N . Thirdly, we present a primality testing algorithm that uses an oracle that outputs τ( …

    toronto-retro Repository record for Applications of Fourier coefficients of modular forms (opens in a new tab)

  7. Pell Equation - Theory and applications to cryptography

    … for defining new powerful probabilistic primality tests, related to the Lucas test included in the widely used Baillie–PSW test. In particular, the new primality tests are equipped with adaptations of the Selfridge method for choosing the parameters, resulting in very powerful tests.

    poli-torino Repository record for Pell Equation - Theory and applications to cryptography (opens in a new tab)

  8. Primality Testing is Polynomial-time: A Mechanised Verification of the AKS Algorithm

    … (AKS) algorithm, a deterministic polynomial-time primality test. This algorithm was first announced by the AKS team in 2002, later improved in 2004. Our work is based on the improved version, with Parts 1 and 2 aim at a formal proof of the correctness of the algorithm, and Part 3 aims at a formal …

    anu Repository record for Primality Testing is Polynomial-time: A Mechanised Verification of the AKS Algorithm (opens in a new tab)

  9. Paralelizace faktorizace celých čísel z pohledu lámání RSA

    Práce se zabývá faktorizací celých čísel. Faktorizace je nejznámější a nejpoužívanější metodou kryptoanalýzy RSA. V rámci této práce byla vybrána a implementována faktorizační metoda zvaná SIQS. I když se jedná o nejrychlejší metodu (do 100 dekadických číslic), není možné ji efektivně počítat v …

    brno-tech Repository record for Paralelizace faktorizace celých čísel z pohledu lámání RSA (opens in a new tab)