Pseudorandom sequences from elliptic curves

P.H.T. Beelen, J.M. Doumen

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    124 Downloads (Pure)

    Abstract

    In this article we will generalize some known constructions to produce pseudorandom sequences with the aid of elliptic curves. We will make use of both additive and multiplicative characters on elliptic curves.
    Original languageEnglish
    Title of host publicationFinite Fields with Applications to Coding Theory, Cryptography and Related Areas
    Subtitle of host publicationProceedings of the Sixth International Conference on Finite Fields and Applications, held at Oaxaca, México, May 21–25, 2001
    EditorsGary L. Mullen, Henning Stichtenoth, Horacio Tapia-Recillas
    Place of PublicationBerlin, Heidelberg
    PublisherSpringer
    Pages37-52
    Number of pages16
    ISBN (Electronic)978-3-642-59435-9
    ISBN (Print)978-3-642-63976-0
    DOIs
    Publication statusPublished - 2002
    Event6th International Conference on Finite Fields and Applications 2001 - Oaxaca, Mexico
    Duration: 21 May 200225 May 2002
    Conference number: 6

    Conference

    Conference6th International Conference on Finite Fields and Applications 2001
    Country/TerritoryMexico
    CityOaxaca
    Period21/05/0225/05/02

    Keywords

    • SCS-Cybersecurity

    Fingerprint

    Dive into the research topics of 'Pseudorandom sequences from elliptic curves'. Together they form a unique fingerprint.

    Cite this