Arithmetic Operations on Multiple Byte Integers and an Introduction to Multiple Byte Fractions

EasyChair Preprint no. 5157, version history

VersionDatePagesVersion notes
1March 16, 202113
2May 17, 202115

Arithmetic Operations on Multiple Byte Integers and an Introduction to Multiple Byte Fractions

 

Introduction:

            The computer consists of bits and bytes. The important thing in computer is its word size which can be data or some computer operation, represented by an integer for everything. The largest integers we have been able to work with have been confined to short, an int or a long. In C++ language, for example, these are one byte, two bytes and four bytes long, respectively. For all types, advanced arithmetical operations are made standard for only that domain of type, otherwise the compiler just ignore the function output, no overflow message.

In principle, however, there is no reason to confine an integer to a specific number of bytes: the concept of a list allows us to work with any number of bytes, dynamically determined according to the transient needs of the program.

                Integers limit in size made files vulnerable to attacks, even thought they were encrypted, because the size of the private key is limited. Also in real life, the size of amounts of large integers is limited to just more than 4 millions.

Keyphrases: Big Data, big numbers, Computer Architecture, data structure, Numerical Computations

BibTeX entry
BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:
@Booklet{EasyChair:5157,
  author = {Ishraga Mustafa Awad Allam},
  title = {Arithmetic Operations on Multiple Byte Integers and an Introduction to Multiple Byte Fractions},
  howpublished = {EasyChair Preprint no. 5157},

  year = {EasyChair, 2021}}