Sciweavers

814 search results - page 3 / 163
» Analysis of Modular Arithmetic
Sort
View
ACSAC
2000
IEEE
13 years 9 months ago
The Chinese Remainder Theorem and its Application in a High-Speed RSA Crypto Chip
The performance of RSA hardware is primarily determined by an efficient implementation of the long integer modular arithmetic and the ability to utilize the Chinese Remainder The...
Johann Großschädl
CAV
2007
Springer
110views Hardware» more  CAV 2007»
13 years 11 months ago
Hector: Software Model Checking with Cooperating Analysis Plugins
We present Hector, a software tool for combining different abstraction methods to extract sound models of heap-manipulating imperative programs with recursion. Extracted models ma...
Nathaniel Charlton, Michael Huth
ICCD
2004
IEEE
138views Hardware» more  ICCD 2004»
14 years 2 months ago
Design and Implementation of Scalable Low-Power Montgomery Multiplier
In this paper, an efficient Montgomery multiplier is introduced for the modular exponentiation operation, which is fundamental to numerous public-key cryptosystems. Four aspects a...
Hee-Kwan Son, Sang-Geun Oh
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 5 months ago
Modular difference logic is hard
In connection with machine arithmetic, we are interested in systems of constraints of the form x + k y + k . Over integers, the satisfiability problem for such systems is polynomi...
Nikolaj Bjørner, Andreas Blass, Yuri Gurevi...