Sciweavers

368 search results - page 7 / 74
» Arithmetic as a Theory Modulo
Sort
View
CORR
2011
Springer
151views Education» more  CORR 2011»
14 years 4 months ago
Generating and Searching Families of FFT Algorithms
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
Steve Haynal, Heidi Haynal
CHES
2004
Springer
130views Cryptology» more  CHES 2004»
15 years 3 months ago
Switching Blindings with a View Towards IDEA
Cryptographic algorithms implemented on smart-cards must be protected against side-channel attacks. Some encryption schemes and hash functions like IDEA, RC6, MD5, SHA-1 alternate ...
Olaf Neiße, Jürgen Pulkus
ARITH
2005
IEEE
15 years 3 months ago
Arithmetic Operations in the Polynomial Modular Number System
We propose a new number representation and arithmetic for the elements of the ring of integers modulo p. The socalled Polynomial Modular Number System (PMNS) allows for fast polyn...
Jean-Claude Bajard, Laurent Imbert, Thomas Plantar...
CAV
2009
Springer
163views Hardware» more  CAV 2009»
15 years 10 months ago
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas...
Leonardo Mendonça de Moura, Yeting Ge
LPAR
2004
Springer
15 years 2 months ago
Abstract DPLL and Abstract DPLL Modulo Theories
DPLL and DPLL Modulo Theories Robert Nieuwenhuis , Albert Oliveras , and Cesare Tinelli We introduce Abstract DPLL, a general and simple abstract rule-based formulation of the Davi...
Robert Nieuwenhuis, Albert Oliveras, Cesare Tinell...