Sökning: "elliptic curve method"

Visar resultat 1 - 5 av 6 uppsatser innehållade orden elliptic curve method.

  1. 1. The Elliptic Curve Method : A Modern Approach to Integer Factorization

    Kandidat-uppsats, KTH/Skolan för teknikvetenskap (SCI)

    Författare :Felix Cao; [2023]
    Nyckelord :Pollard s p-1 method; Factorization; Elliptic curves; Lentra s; Elliptic curve method;

    Sammanfattning : In this paper, we present a study of elliptic curves, focusing on theirunderlying mathematical concepts, properties and applications in numbertheory. We begin by introducing elliptic curves and their unique features,discussing their algebraic structure, and exploring their group law, pro-viding examples and geometric interpretations. LÄS MER

  3. 2. On Pollard's rho method for solving the elliptic curve discrete logarithm problem

    Kandidat-uppsats, Linnéuniversitetet/Institutionen för matematik (MA)

    Författare :Jenny Falk; [2019]
    Nyckelord :elliptic curves; Pollard s rho method; elliptic curve discrete logarithm problem; cryptography; adding walk; mixed walk; cycle-detecting algorithm; iterating function; random walk;

    Sammanfattning :     Cryptosystems based on elliptic curves are in wide-spread use, they are considered secure because of the difficulty to solve the elliptic curve discrete logarithm problem. Pollard's rho method is regarded as the best method for attacking the logarithm problem to date, yet it is still not efficient enough to break an elliptic curve cryptosystem. LÄS MER

  4. 3. Points of High Order on Elliptic Curves : ECDSA

    Master-uppsats, Linnéuniversitetet/Institutionen för matematik (MA)

    Författare :Behnaz Kouchaki Barzi; [2016]
    Nyckelord :Digital signature DS. ; Elliptic Curve Digital Signature Algorithm ECDSA ; Elliptic Curve Discrete Logarithm Problem ECDLP ; Baby Step; Giant Step Bs.Gs. ; Pollard’s Rho;

    Sammanfattning : This master thesis is about Elliptic Curve Digital Signature Algorithm or ECDSA and two of the known attacks on this security system. The purpose of this thesis is to find points that are likely to be points of high order on an elliptic curve. If we have a point P of high order and if Q = mP, then we have a large set of possible values of m. LÄS MER

  5. 4. On the Applicability of a Cache Side-Channel Attack on ECDSA Signatures : The Flush+Reload attack on the point multiplication in ECDSA signature generation process

    Master-uppsats, Blekinge Tekniska Högskola/Institutionen för datalogi och datorsystemteknik

    Författare :Sai Prashanth Josyula; [2015]
    Nyckelord :Digital signatures; Elliptic curve cryptography; GLV method; Side-channel attack;

    Sammanfattning : Context. Digital counterparts of handwritten signatures are known as Digital Signatures. The Elliptic Curve Digital Signature Algorithm (ECDSA) is an Elliptic Curve Cryptography (ECC) primitive, which is used for generating and verifying digital signatures. LÄS MER

  7. 5. Analytical and Numerical Analysis of the Acoustics of Shallow Flow Reversal Chambers

    Master-uppsats, KTH/MWL Marcus Wallenberg Laboratoriet

    Författare :Alireza Qazizadeh; [2012]
    Nyckelord :;

    Sammanfattning : Flow reversal chambers are mainly used to accomplish a compact silencer design needed on a vehicle. Generally in this configuration the inlet and outlet ports are on the same face and the flow direction is reversed. LÄS MER