Search Constraints

Start Over
Filtering by: Contributor O’Malley, Kathleen G. Remove constraint Contributor: O’Malley, Kathleen G. Advisor Koc, Cetin Kaya Remove constraint Advisor: Koc, Cetin Kaya

Search Results

  • New methods for finite field arithmetic

    Creator:
    Yanik, Tuğrul
    Abstract:
    We describe novel methods for obtaining fast software implementations of the arithmetic operations in the finite field GF(p) and GF(p[superscript k]). In GF(p) we realize an extensive speedup in modular addition and subtraction routines and some small speedup in the modular multiplication routine with an arbitrary prime modulus p which...
    Resource Type:
    Dissertation
    Full Text:
    and an element a e G. 2. A generates a random integer a, computes aa in G, and transmits aa to B

  • High-speed algorithms & architectures for number-theoretic cryptosystems

    Creator:
    Acar, Tolga
    Abstract:
    Computer and network security systems rely on the privacy and authenticity of information, which requires implementation of cryptographic functions. Software implementations of these functions are often desired because of their flexibility and cost effectiveness. In this study, we concentrate on developing high-speed and area-efficient modular multiplication and exponentiation algorithms for...
    Resource Type:
    Dissertation
    Full Text:
    & Computer Engineering Dean of the G uate School I understand that my thesis will become part of the

  • Efficient wireless security protocols based on elliptic curve cryptography

    Creator:
    Aydos, Murat
    Abstract:
    In recent years, the elliptic curve cryptosystems (ECC) have received attention due to their increased security with smaller key size which brings the advantage of less storage area and less bandwidth. Elliptic curve cryptography provides a methodology for obtaining high-speed, efficient, and scalable implementations of network security protocols. In addition...
    Resource Type:
    Dissertation
    Full Text:
    . (Setup) A and B publicly select a (multiplicatively written) finite group G and an element a E G. 2. A

  • Fast bit-level, word-level and parallel arithmetic in finite fields for elliptic curve cryptosystems

    Creator:
    Halbutoğulları, Alper
    Abstract:
    Computer and network security has recently become a popular subject due to the explosive growth of the Internet and the migration of commerce practices to the electronic medium. Thus the authenticity and privacy of the information transmitted and the data stored on networked computers is of utmost importance. The deployment...
    Resource Type:
    Dissertation
    Full Text:
    . (Setup) A and B publicly select a (multiplicatively written) finite group G and an element a E G. 2. A

  • Improving the Karatsuba-Ofman multiplication algorithm for special applications

    Creator:
    Erdem, Serdar S.
    Abstract:
    In this thesis, we study the Karatsuba-Ofman Algorithm (KOA), which is a recursive multi-precision multiplication method, and improve it for certain special applications. This thesis is in two parts. In the first part, we derive an efficient algorithm from the KOA to multiply the operands having a precision of 2[superscript...
    Resource Type:
    Dissertation

  • New algorithms and architectures for arithmetic in GF(2[superscript m]) suitable for elliptic curve cryptography

    Creator:
    Rodríguez-Henríquez, Francisco
    Abstract:
    During the last few years we have seen formidable advances in digital and mobile communication technologies such as cordless and cellular telephones, personal communication systems, Internet connection expansion, etc. The vast majority of digital information used in all these applications is stored and also processed within a computer system, and...
    Resource Type:
    Dissertation
    Full Text:
    unit element and if p = fg then f or g must be a unit, that is, a constant polynomial. Let p(x) be an

  • Implementation aspects of elliptic curve cryptography

    Creator:
    Savaș, Erkay
    Abstract:
    As the information-processing and telecommunications revolutions now underway will continue to change our life styles in the rest of the 21st century, our personal and economic lives rely more and more on our ability to transact over the electronic medium in a secure way. The privacy, authenticity, and integrity of...
    Resource Type:
    Dissertation