• Login
    View Item 
    •   Home
    • Brock University Publications & Manuscripts
    • Faculty of Mathematics and Science
    • Computer Science
    • View Item
    •   Home
    • Brock University Publications & Manuscripts
    • Faculty of Mathematics and Science
    • Computer Science
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of BrockUCommunitiesPublication DateAuthorsTitlesSubjectsThis CollectionPublication DateAuthorsTitlesSubjectsProfilesView

    My Account

    LoginRegister

    Statistics

    Display statistics

    Genetic programming for improved cryptanalysis of elliptic curve cryptosystems

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Ribaric_CEC_2017_Accepted_Vers ...
    Size:
    290.8Kb
    Format:
    PDF
    Description:
    Final Accepted Version
    Download
    Author
    Ribaric, Tim
    Houghten, Sheridan
    Keyword
    Elliptic curves
    Elliptic curve cryptography
    Ciphers
    Genetic programming
    Partitioning algorithms
    genetic algorithms
    public key cryptography
    
    Metadata
    Show full item record
    URI
    http://hdl.handle.net/10464/16889
    Abstract
    Public-key cryptography is a fundamental compo- nent of modern electronic communication that can be constructed with many different mathematical processes. Presently, cryp- tosystems based on elliptic curves are becoming popular due to strong cryptographic strength per small key size. At the heart of these schemes is the intractability of the elliptic curve discrete logarithm problem (ECDLP). Pollard’s Rho algorithm is a well known method for solving the ECDLP and thereby breaking ciphers based on elliptic curves. It has the same time complexity as other known methods but is advantageous due to smaller memory requirements. This paper considers how to speed up the Rho process by modifying a key component: the iterating function, which is the part of the algorithm responsible for determining what point is considered next when looking for a collision. It is replaced with an alternative that is found through an evolutionary process. This alternative consistently and significantly decreases the number of iterations required by Pollard’s Rho Algorithm to successfully find a solution to the ECDLP.
    ae974a485f413a2113503eed53cd6c53
    10.1109/cec.2017.7969342
    Scopus Count
    Collections
    Computer Science

    entitlement

     
    DSpace software (copyright © 2002 - 2023)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.