210 search results - page 28 / 42 » Widening Integer Arithmetic |
IJNSEC
2010
13 years 5 months ago
2010
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
ARITH
1999
IEEE
14 years 3 months ago
1999
IEEE
It is widely recognized that security issues will play a crucial role in the majority of future computer and communication systems. Central tools for achieving system security are...
ISSAC
1992
Springer
14 years 2 months ago
1992
Springer
Abstract. Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The well-known...
AMAI
2004
Springer
14 years 2 months ago
2004
Springer
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Those programs assert code...
ASM
2010
ASM
14 years 1 months ago
2010
ASM
Abstract. Software development in B and Event-B generates proof obligations that have to be discharged using theorem provers. The cost of such developments therefore depends direct...