menu
{ "item_title" : "Investigation into the Cryptographic Properties of Elliptic Curves Defined over a Prime Field", "item_author" : [" Adrian O'Gara "], "item_description" : "Bachelor Thesis from the year 2014 in the subject Computer Science - IT-Security, grade: 90.00, course: Computer Security & Digital Forensics, language: English, abstract: Elliptic curves, as used in cryptography, are essentially points bounded by a finite prime field which display group properties that facilitate their usage in a cryptosystem. The Discrete Log Problem (DLP) - based on a large prime order subgroup of (Zp)* - constitutes the essence of Elliptic Curve Cryptography (ECC) and can be summed up as such; find an integer, k, such that Q = kP where k = logp(Q) and P, Q ∈ (Zp)*. Compared to the Integer Factorisation Problem - upon which RSA is constructed - the DLP achieves a greater level of complexity in terms of resistance to attack. This project seeks to describe the mathematical properties that enable ECC to outperform RSA, culminating in the construction of a software system to demonstrate ECC's ability to securely encipher and decipher files and text, according to the National Security Agency's (NSA) Cryptographic Interoperability Strategy (CIS) or Suite B Cryptography.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/3/65/694/562/3656945624_b.jpg", "price_data" : { "retail_price" : "25.50", "online_price" : "25.50", "our_price" : "25.50", "club_price" : "25.50", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Investigation into the Cryptographic Properties of Elliptic Curves Defined over a Prime Field|Adrian O'Gara

Investigation into the Cryptographic Properties of Elliptic Curves Defined over a Prime Field

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

Bachelor Thesis from the year 2014 in the subject Computer Science - IT-Security, grade: 90.00, course: Computer Security & Digital Forensics, language: English, abstract: Elliptic curves, as used in cryptography, are essentially points bounded by a finite prime field which display group properties that facilitate their usage in a cryptosystem. The Discrete Log Problem (DLP) - based on a large prime order subgroup of (Zp)* - constitutes the essence of Elliptic Curve Cryptography (ECC) and can be summed up as such; find an integer, k, such that Q = kP where k = logp(Q) and P, Q ∈ (Zp)*. Compared to the Integer Factorisation Problem - upon which RSA is constructed - the DLP achieves a greater level of complexity in terms of resistance to attack. This project seeks to describe the mathematical properties that enable ECC to outperform RSA, culminating in the construction of a software system to demonstrate ECC's ability to securely encipher and decipher files and text, according to the National Security Agency's (NSA) Cryptographic Interoperability Strategy (CIS) or Suite B Cryptography.

This item is Non-Returnable

Details

  • ISBN-13: 9783656945628
  • ISBN-10: 3656945624
  • Publisher: Grin Verlag
  • Publish Date: April 2015
  • Dimensions: 8.27 x 5.83 x 0.11 inches
  • Shipping Weight: 0.15 pounds
  • Page Count: 44

Related Categories

You May Also Like...

    1

BAM Customer Reviews