IEEE 1363.1-2008 PDF

IEEE 1363.1-2008 PDF

IEEE Standard Specification for Public Key Cryptographic Techniques Based on Hard Problems over Lattices

$59.50 $119.00 -50%
isbn 9780738158648
Product Code: IEEE 1363.1
Stock In Stock
Published: 03/10/2009
Number of Pages: 81
File Size: 1 file, 1.2 MB

Available Options

Product Description

IEEE Standard Specification for Public Key Cryptographic Techniques Based on Hard Problems over Lattices

Introduction: This introduction is not part of IEEE Std 1363.1-2008, IEEE Standard Specification for Public Key Cryptographic Techniques Based on Hard Problems over Lattices. The IEEE P1363™ project started as the “Standard for Rivest-Shamir-Adleman, Diffie-Hellman, and Related Public Key Cryptography” with its first meeting in January 1994, following a strategic initiative by the Microprocessor Standards Committee to develop standards for cryptography. Over the next eight years, the working group produced a broad standard reflecting the state of the art in public key cryptography, including techniques from three major families of hard problems. In addition, the working group drafted an addendum that provides additional techniques from those three major families. A more thorough history of the IEEE P1363 working group and its contributions beyond IEEE Std 1363™-2000 are given in the Introduction to IEEE Std 1363-2000. At the same time, new cryptographic research was producing additional families of cryptographic techniques such as the family of techniques based on hard problems over lattices. These techniques enjoy operating characteristics that make them attractive in certain implementation environments, and thus they have received considerable scrutiny and deployment. As a result, the working group proposed a new project to standardize techniques from this family. This project was approved by the Microprocessors and Microcomputers Standards Committee, and this current standard is the res

Contents:

  • 1.1 Scope
  • 1.2 Purpose
  • 3.1 Definitions
  • 3.2 Acronyms and abbreviations
  • 4.1 General model
  • 4.2 Schemes
  • 4.3 Additional methods
  • 4.4 Algorithm specification conventions
  • 6.1 Introduction
  • 6.2 Polynomial representation
  • 6.3 Polynomial operations
  • 6.3.1 Polynomial multiplication
  • 6.3.2 Reduction of a polynomial mod q
  • 6.3.3 Inversion in (Z/qZ)[X]/(XN – 1)
  • 7.1 Bit strings and octet strings
  • 7.2 Converting between integers and bit strings (I2BSP and BS2IP)
  • 7.2.1 Integer to bit string primitive (I2BSP)
  • 7.2.2 Bit string to integer primitive (BS2IP)
  • 7.3 Converting between integers and octet strings (I2OSP and OS2IP)
  • 7.3.1 Integer to octet string primitive (I2OSP)
  • 7.3.2 Octet string to integer primitive (OS2IP)
  • 7.4 Converting between bit strings and right-padded octet strings (BS2ROSP and ROS2BSP)
  • 7.4.1 Bit string to right-padded octet string primitive (BS2ROSP)
  • 7.4.2 Right-padded octet string to bit string primitive (ROS2BSP)
  • 7.5 Converting between ring elements and bit strings (RE2BSP and BS2REP)
  • 7.5.1 Ring element to bit string primitive (RE2BSP)
  • 7.5.2 Bit string to ring element primitive (BS2REP)
  • 7.6 Converting between ring elements and octet strings (RE2OSP and OS2REP)
  • 7.6.1 Ring element to octet string primitive (RE2OSP)
  • 7.6.2 Octet string to ring element primitive (OS2REP)

Be the first to write a review for this product.

Write a review

Note: HTML is not translated!
Bad           Good
IEEE 1363.1-2008 PDF

IEEE 1363.1-2008 PDF

$59.50 $119.00