A Software Library for Multi Precision Arithmetic

A Software Library for Multi Precision Arithmetic

Kannan Balasubramanian, Ahmed Mahmoud Abbas
ISBN13: 9781522529156|ISBN10: 1522529152|EISBN13: 9781522529163
DOI: 10.4018/978-1-5225-2915-6.ch016
Cite Chapter Cite Chapter

MLA

Balasubramanian, Kannan, and Ahmed Mahmoud Abbas. "A Software Library for Multi Precision Arithmetic." Algorithmic Strategies for Solving Complex Problems in Cryptography, edited by Kannan Balasubramanian and M. Rajakani, IGI Global, 2018, pp. 195-227. https://doi.org/10.4018/978-1-5225-2915-6.ch016

APA

Balasubramanian, K. & Abbas, A. M. (2018). A Software Library for Multi Precision Arithmetic. In K. Balasubramanian & M. Rajakani (Eds.), Algorithmic Strategies for Solving Complex Problems in Cryptography (pp. 195-227). IGI Global. https://doi.org/10.4018/978-1-5225-2915-6.ch016

Chicago

Balasubramanian, Kannan, and Ahmed Mahmoud Abbas. "A Software Library for Multi Precision Arithmetic." In Algorithmic Strategies for Solving Complex Problems in Cryptography, edited by Kannan Balasubramanian and M. Rajakani, 195-227. Hershey, PA: IGI Global, 2018. https://doi.org/10.4018/978-1-5225-2915-6.ch016

Export Reference

Mendeley
Favorite

Abstract

The most prevalent need for multiple precision arithmetic, often referred to as “bignum” math, is within the implementation of public key cryptography algorithms. Algorithms such as RSA and Diffie-Hellman require integers of significant magnitude to resist known cryptanalytic attacks. As of now, a typical RSA modulus would be at least greater than 10^309. However, modern programming languages such as ISO C and Java only provide intrinsic support for integers that are relatively small and single precision. This chapter describe the modules provided by one such library for the C Programming Language.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.