208 search results - page 9 / 42 » Arithmetic Operations in the Polynomial Modular Number Syste... |
111
click to vote
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper describes a hardware architecture for modular multiplication operation which is efficient for bit-lengths suitable for both commonly used types of Public Key Cryptogra...
SAC
2006
ACM
15 years 5 months ago
2006
ACM
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ...
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We consider a number of dynamic problems with no known poly-logarithmic upper bounds, and show that they require n(1) time per operation, unless 3SUM has strongly subquadratic alg...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equation. ...
ARITH
2003
IEEE
15 years 5 months ago
2003
IEEE
This work uses a partially redundant number system as an internal format for floating point arithmetic operations. The redundant number system enables carry free arithmetic opera...