814 search results - page 47 / 163 » Analysis of Modular Arithmetic |
ISSAC
2009
Springer
15 years 4 months ago
2009
Springer
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...
EUROCRYPT
2010
Springer
15 years 2 months ago
2010
Springer
We describe a very simple “somewhat homomorphic” encryption scheme using only elementary modular arithmetic, and use Gentry’s techniques to convert it into a fully homomorph...
CRYPTO
1993
Springer
15 years 2 months ago
1993
Springer
Constructions for hash functions based on a block cipher are studied where the size of the hashcode is equal to the block length of the block cipher and where the key size is appro...
TASE
2008
IEEE
14 years 9 months ago
2008
IEEE
The safety of pointer programs is an important issue in high-assurance software design, and their verification remains a major challenge. Pointer Logic has been proposed to verify...
ASIACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
The security of key agreement protocols has traditionally been notoriously hard to establish. In this paper we present a modular approach to the construction of proofs of security ...