Search Constraints

Start Over
Filtering by: Advisor Koç, Çetin Kaya Remove constraint Advisor: Koç, Çetin Kaya Degree Name Doctor of Philosophy (Ph.D.) Remove constraint Degree Name: Doctor of Philosophy (Ph.D.)

Search Results

  • 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:
    & Architectures For Number-Theoretic Cryptosystems Abstract approved. cetin K. Koc Computer and network

  • 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:
    Abstract approved: Cretin K. Koc Computer and network security has recently become a popular subject due

  • 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:
    approved: based on Elliptic Curve Cryptography cetin K. Koç In recent years, the elliptic curve

  • 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:
    -Ofman Multiplication Algorithm Abstract approved: for Special Applications çetin K. Koc In this

  • 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
    Full Text:
    : Implementation Aspects of Elliptic Curve Cryptography Abstract approved: çetin K. Koç As the information

  • 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:
    Elliptic Curve Cryptography cetin K. Koç During the last few years we have seen formidable advances in

  • 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:
    Methods for Finite Field Arithmetic Abstract approved: cetin K. Koç We describe novel methods for

  • Advances in side-channel cryptanalysis : microarchitectural attacks

    Creator:
    Aciiçmez, Onur
    Abstract:
    Cryptographic devices leak timing and power consumption information that is easily measurable, radiation of various levels, and more. Such devices also have additional inputs, other than plaintext and keys, like voltage, which can be modified to force the device to produce certain faulty outputs that can be used to reveal...
    Resource Type:
    Dissertation
    Full Text:
    : Advances in Side-Channel Cryptanalysis: MicroArchitectural Attacks Abstract approved: Çetin Kaya Koç

  • Cryptanalysis and enhancement of authentication protocols

    Creator:
    Kim, Minho
    Abstract:
    Authentication protocols play important roles in network security. A variety of authentication protocols ranging from complex public-key cryptosystems to simple password-based authentication schemes have been proposed. However, currently there is no fully secure authentication scheme that can resist all known attacks. When a user authentication is performed over an insecure...
    Resource Type:
    Dissertation
    Full Text:
    : Cryptanalysis and Enhancement of Authentication Protocols . Abstract approved: Çetin Kaya Koç

  • Spectral modular arithmetic

    Creator:
    Saldamli, Gökay
    Abstract:
    In many areas of engineering and applied mathematics, spectral methods provide very powerful tools for solving and analyzing problems. For instance, large to extremely large sizes of numbers can efficiently be multiplied by using discrete Fourier transform and convolution property. Such computations are needed when computing π to millions of...
    Resource Type:
    Dissertation