Handling BigInteger Computations in the Implementation of the RSA Model

Developing systems that can handle very large integers is challenging, especially if we are trapped in using some of the well-known programming languages such as VB, C++, Delphi, or Java. Their numeric data types have defined finite ranges. Innovative methods are required to enable the handling of large integer over and above the ranges supported by available primitive data types. Implementation of the RSA model is a typical case where very large integers are used. This paper investigates incorporation of very large integers into the implementation of the RSA model. We precisely describe parts of the RSA algorithm where such innovations are sought and how the concept of the BigInteger class fits in. Our illustrations assume programming in Java. While the BigInteger class is available for use in mathematical procedures involving very large integral sums beyond the limits of the appropriate basic data type, developers either do not or rarely use the class due to lack of functional examples of where such libraries were used. This paper provides valuable insights into the potential advent of new data types. These insights provide basic insights into the potential need for new developments in programming languages, especially the need to invent even larger types of numerical data types in programming languages. In our views, this work in progress offers foundational views towards implementation of better siblings of the RSA model.