BigNum Math Implementing Cryptographic Multiple Precision Arithmetic 1st Edition by Tom Denis ISBN 1597491128 9780080488387

BigNum Math: Implementing Cryptographic Multiple Precision Arithmetic 1st Edition by Tom St Denis – Ebook PDF Instant Download/Delivery: 1597491128, 9780080488387

Full download BigNum Math: Implementing Cryptographic Multiple Precision Arithmetic 1st Edition after payment

 

 

Product details:

ISBN 10: 1597491128

ISBN 13: 9780080488387

Author:  Tom St Denis 

BigNum Math: Implementing Cryptographic Multiple Precision Arithmetic 1st Edition: Implementing cryptography requires integers of significant magnitude to resist cryptanalytic attacks. Modern programming languages only provide support for integers which are relatively small and single precision. The purpose of this text is to instruct the reader regarding how to implement efficient multiple precision algorithms.

Bignum math is the backbone of modern computer security algorithms. It is the ability to work with hundred-digit numbers efficiently using techniques that are both elegant and occasionally bizarre. This book introduces the reader to the concept of bignum algorithms and proceeds to build an entire library of functionality from the ground up. Through the use of theory, pseudo-code and actual fielded C source code the book explains each and every algorithm that goes into a modern bignum library. Excellent for the student as a learning tool and practitioner as a reference alike BigNum Math is for anyone with a background in computer science who has taken introductory level mathematic courses. The text is for students learning mathematics and cryptography as well as the practioner who needs a reference for any of the algorithms documented within.

 

BigNum Math: Implementing Cryptographic Multiple Precision Arithmetic 1st Edition Table of contents:

• Chapter 1: Introduction

  • Multiple precision arithmetic
  • Purpose of this text
  • Discussion and notation
  • Exercises
  • Introduction to LibTomMath
  • Choice of LibTomMath

• Chapter 2: Getting started

  • Library basics
  • What is a multiple precision integer?
  • Argument passing
  • Return values
  • Initialization and clearing
  • Maintenance algorithms
    • Augmenting an mp_int’s precision
    • Initializing variable precision mp_ints

• Chapter 3: Basic operations

  • Introduction
  • Assigning values to mp_int structures
  • Zeroing an integer
  • Sign manipulation
  • Small constants
  • Comparisons

• Chapter 4: Basic arithmetic

  • Introduction
  • Addition and subtraction
  • Bit and digit shifting
  • Polynomial basis operations
  • Powers of two

• Chapter 5: Multiplication and squaring

  • The multipliers
  • Multiplication
  • Squaring

• Chapter 6: Modular reduction

  • Basics of modular reduction
  • The Montgomery reduction
  • The diminished radix algorithm
  • Algorithm comparison

• Chapter 7: Exponentiation

  • Exponentiation basics
  • k–ary exponentiation
  • Modular exponentiation
  • Quick power of two

• Chapter 8: Higher level algorithms

  • Integer division with remainder
  • Single digit helpers
  • Random number generation
  • Formatted representations

• Chapter 9: Number theoretic algorithms

  • Greatest common divisor
    • Complete greatest common divisor
  • Least common multiple
  • Jacobi symbol computation
  • Modular inverse
  • Primality tests

 

People also search for BigNum Math: Implementing Cryptographic Multiple Precision Arithmetic 1st Edition:

how is math used in cryptography
    
cryptography math examples
    
what math do you need for cryptography
    
is cryptography math or computer science
    
bignum multiplication
    
bignum arithmetic

Tags:

Tom Denis,BigNum,Math,Implementing,Cryptographic,Multiple,Precision,Arithmetic