From Wikipedia, the free encyclopedia

In computer programming, an integer overflow occurs when an arithmetic operation attempts to create a numeric value that is larger than can be represented within the available storage space. For instance, adding 1 to the largest value that can be represented constitutes an integer overflow. The most common result in these cases is for the least significant representable bits of the result to be stored (the result is said to wrap). On some processors the result saturates, that is once the maximum value is reached attempts to make it larger simply return the maximum result.

Contents 1 Origin 2 Security ramifications 3 Techniques for mitigating integer overflow problems 4 See also 5 External links

The register width of a processor determines the range of values that can be represented. Typical binary register widths include:

8 bits (maximum representable value 255),

16 bits (maximum representable value 65,535),

32 bits (the most common width for personal computers as of 2005, maximum representable value 4,294,967,295),

64 bits (maximum representable value 18,446,744,073,709,551,615),

128 bits (maximum representable value approx. 10³⁸)

Since an arithmetic operation may produce a result larger than the maximum representable value, a potential error condition may result. In the C programming language, for example, signed integer overflow causes undefined behavior, although arithmetic on unsigned integers, however, is reduced modulo a power of two, meaning that unsigned integers "wrap around" on overflow.

In computer graphics or signal processing, it is typical to work on data that ranges from 0 to 1 or from -1 to 1. An example of this is a grayscale image where 0 represents black, 1 represents white, and values in-between represent varying shades of gray. One operation that you may want to support is brightening the image by multiplying every pixel by a constant. Saturated arithmetic allows you to just blindly multiply every pixel by that constant without worrying about overflow by just sticking to a reasonable outcome that all these pixels larger than 1 (i.e. "brighter than white") just become white and all values "darker than black" just become black.

In some situations a program may make the assumption that a variable always contains a positive value. If the variable has a signed integer type an overflow can causes its value to wrap and become negative, violating the assumption contained in the program and perhaps leading to unintended behavior. Similarly, subtracting from a small unsigned value may cause it to wrap to a large positive value which may also be an unexpected behavior.

Some languages, such as Lisp and Ada, provide mechanisms that, if used, result in accidental overflow throwing an exception. Many languages do not support such functionality.

List of techniques and methods that might be used to mitigate against the consequences of integer overflow:

• The effects of integer-based attacks for C/C++ and how to defend against them by using subtyping in Efficient and Accurate Detection of Integer-based Attacks.

• Arithmetic overflow
• SIGFPE
• Buffer overflow
• Heap overflow
• Pointer swizzling
• Software testing
• Static code analysis

• Phrack #60, Basic Integer Overflows
• Phrack #60, Big Loop Integer Protection