Search Constraints

Start Over
Filtering by: Creator Yanik, Tuğrul Remove constraint Creator: Yanik, Tuğrul Language English [eng] Remove constraint Language: English [eng]

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:
    GF(p) arithmetic. Redacted for Privacy ©Copyright by Tugrul Yanik November 21, 2001 All Rights

  • ECDSA optimizations on ARM processor for a NIST curve over GF(2m)

    Creator:
    Turan, Eda
    Abstract:
    The Elliptic Curve Digital Signature Algorithm (ECDSA) is one of the most popular algorithms to digitally sign streams or blocks of data. In this thesis we concentrate on porting and optimizing the ECDSA on the ARM7 processor for a particular NIST curve over GF(2[superscript m]). The selected curve is a...
    Resource Type:
    Masters Thesis
    Full Text:
    , Erkay Sava, Haluk Kent Tanik and Tugrul Yanik. Finally, I acknowledge financial support for this work

  • ECDSA optimizations on an ARM processor for a NIST curve over GF(p)

    Creator:
    Tanik, Haluk Kent
    Abstract:
    The Elliptic Curve Digital Signature Algorithm (ECDSA) is the elliptic curve analog of the Digital Signature Algorithm (DSA) and a federal government approved digital signature method. In this thesis work, software optimization techniques were applied to speed up the ECDSA for a particular NTST curve over GF(p). The Montgomery multiplication...
    Resource Type:
    Masters Thesis
    Full Text:
    research: Serdar S. Erdem, Erkay Savas, Eda Turan and Tugrul Yanik. Finally, I acknowledge financial

  • 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:
    Lab researchers. In particular, I acknowledge Erkay Sava, Tugrul Yanik, Serdar Erdem for providing

  • 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
    Full Text:
    of gratitude to the Information Security Lab researchers. In particular, I acknowledge Tugrul Yanik

  • New hardware algorithms and designs for Montgomery modular inverse computation in Galois Fields GF(p) and GF(2 [superscript n])

    Creator:
    Gutub, Adnan Abdul-Aziz
    Abstract:
    The computation of the inverse of a number in finite fields, namely Galois Fields GF(p) or GF(2ⁿ), is one of the most complex arithmetic operations in cryptographic applications. In this work, we investigate the GF(p) inversion and present several phases in the design of efficient hardware implementations to compute the...
    Resource Type:
    Dissertation
    Full Text:
    , Tugrul Yanik, Budiyoso Kumiawan, Serdar Erdem, Don Heer, and Cohn Van Dyke, for providing valuable