Sciweavers

814 search results - page 12 / 163
» Analysis of Modular Arithmetic
Sort
View
CSL
2007
Springer
15 years 4 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
Arnold Beckmann
FDTC
2006
Springer
102views Cryptology» more  FDTC 2006»
15 years 1 months ago
Non-linear Residue Codes for Robust Public-Key Arithmetic
We present a scheme for robust multi-precision arithmetic over the positive integers, protected by a novel family of non-linear arithmetic residue codes. These codes have a very hi...
Gunnar Gaubatz, Berk Sunar, Mark G. Karpovsky
ITCC
2005
IEEE
15 years 3 months ago
A Scalable Dual Mode Arithmetic Unit for Public Key Cryptosystems
Elliptic Curve Cryptosystems (ECC) have become popular in recent years due to their smaller key sizes than traditional public key schemes such as RSA. However the gap between the ...
Francis M. Crowe, Alan Daly, William P. Marnane
IPL
1998
177views more  IPL 1998»
14 years 9 months ago
A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation
A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...
JaeCheol Ha, Sang-Jae Moon
AML
2002
69views more  AML 2002»
14 years 9 months ago
Transfer principles in nonstandard intuitionistic arithmetic
Using a slight generalization, due to Palmgren, of sheaf semantics, we present a term-model construction that assigns a model to any first-order intuitionistic theory. A modificat...
J. Avigad, Jeremy Helzner