Integer overflow

In computer programming, an integer overflow occurs when an arithmetic operation attempts to create a numeric value that is outside of the range that can be represented with a given number of digits – either higher than the maximum or lower than the minimum representable value. The most common result of an overflow is that the least significant representable digits of the result are stored; the result is said to wrap around the maximum (i.e. modulo a power of the radix, usually two in modern computers, but sometimes ten or another radix). An overflow condition may give results leading to unintended behavior. In particular, if the possibility has not been anticipated, overflow can compromise a program's reliability and security. For some applications, such as timers and clocks, wrapping on overflow can be desirable. The C11 standard states that for unsigned integers, modulo wrapping is the defined behavior and the term overflow never applies: "a computation involving unsigned opera

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (9)

Related publications

Related people

Related units

Related concepts (37)

Related concepts

Related courses (22)

Related courses

Related lectures (35)

Related lectures

Constructive Training Methods for Feedforward Neural Networks with Binary Weights

Frédéric Aviolat

Quantization of the parameters of a Perceptron is a central problem in hardware implementation of neural networks using a numerical technology. A neural model with each weight limited to a small integer range will require little surface of silicon. Moreover, according to Occam's razor principle, better generalization abilities can be expected from a simpler computational model. The price to pay for these benefits lies in the difficulty to train these kind of networks. This paper proposes essentially two new ideas for constructive training algorithms, and demonstrates their efficiency for the generation of feedforward networks composed of Boolean threshold gates with discrete weights. A proof of the convergence of these algorithms is given. Some numerical experiments have been carried out and the results are presented in terms of the size of the generated networks and of their generalization abilities.

1996

A low power 2.4 GHz front end with MEMS lattice based channel filtering at RF

Christian Enz, Aravind Prasad Heragu Singaiyengar

In this work, a sub sampling receiver front end at 2.4 GHz with high Q filtering to perform channel selection at RF is presented. A low power solution for channel selection directly at RF is proposed in this work using pseudo-self-biased inverter amplifier with a BAW resonator lattice as a load to realize high selectivity. This work focusses on the Bluetooth LE standard, however the front-end can be used for any protocol standards for radios working at 2.4 GHz. A low power BAW based digitally controlled oscillator (DCO) is used as a reference to a LC PLL to perform channel selection. An integer divided version of the BAW DCO signal is used as clock for the sub-sampler to down-convert the selected channel from super-high IF to baseband in quadrature. The proposed architecture is designed in 0.18μm CMOS process and validated using ELDO-RF simulations. © 2012 IEEE.

2012

Attacks on the birational permutation signature schemes

Jacques Stern, Serge Vaudenay

Shamir (1993) presented a family of cryptographic signature schemes based on birational permutations of the integers modulo a large integer N of unknown factorization. These schemes are attractive because of the low computational requirements, both for signature generation and signature verification. However, the two schemes presented in Shamir's paper are weak. We show how to break the first scheme, by first reducing it algebraically to the earlier Ong-Schnorr-Shamir signature scheme (1984), and then applying the Pollard (1987) solution to that scheme. We then show some attacks on the second scheme. These attacks give ideas which can be applied to schemes in this general family

1993

Integer (computer science)

In computer science, an integer is a datum of integral data type, a data type that represents some range of mathematical integers. Integral data types may be of different sizes and may or may not be

Software bug

A software bug is an error, flaw or fault in the design, development, or operation of computer software that causes it to produce an incorrect or unexpected result, or to behave in unintended ways.

Arbitrary-precision arithmetic

In computer science, arbitrary-precision arithmetic, also called bignum arithmetic, multiple-precision arithmetic, or sometimes infinite-precision arithmetic, indicates that calculations are performe

CS-108: Practice of object-oriented programming

Les étudiants perfectionnent leurs connaissances en Java et les mettent en pratique en réalisant un projet de taille conséquente. Ils apprennent à utiliser et à mettre en œuvre les principaux types de collections (listes, ensembles, tables associatives), et examinent quelques patrons de conception.

EE-336: Electronic circuits and systems

Ce cours présente l'analyse et la conception des circuits et systèmes électroniques sous forme discrète et intégrée. L'accent est mis sur les applications dans le domaine des télécommunications.

COM-301: Computer security

This is an introductory course to computer security and privacy. Its goal is to provide students with means to reason about security and privacy problems, and provide them with tools to confront them.