210 search results - page 37 / 42 » Widening Integer Arithmetic |
CHES
2003
Springer
14 years 19 days ago
2003
Springer
Abstract. A novel technique for computing a 2n-bit modular multiplication using n-bit arithmetic was introduced at CHES 2002 by Fischer and Seifert. Their technique makes use of an...
ISSAC
2001
Springer
13 years 12 months ago
2001
Springer
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
ICCAD
2007
IEEE
2007
IEEE
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors
13 years 11 months ago
Abstract: Polynomial computations over fixed-size bitvectors are found in many practical datapath designs. For efficient RTL synthesis, it is important to identify good decompositi...
DIAGRAMS
2006
Springer
13 years 11 months ago
2006
Springer
The intuitive properties of configurations of planar non-overlapping closed curves (boundaries) are presented as a pure boundary mathematics. The mathematics, which is not incorpor...
EUROCRYPT
2006
Springer
13 years 11 months ago
2006
Springer
NTRU is a very efficient public-key cryptosystem based on polynomial arithmetic. Its security is related to the hardness of lattice problems in a very special class of lattices. Th...