Sciweavers

1945 search results - page 141 / 389
» Speeding up Serpent
Sort
View
DCC
2006
IEEE
16 years 6 months ago
Trading Inversions for Multiplications in Elliptic Curve Cryptography
Recently, Eisentr?ager et al. proposed a very elegant method for speeding up scalar multiplication on elliptic curves. Their method relies on improved formulas for evaluating S = (...
Mathieu Ciet, Marc Joye, Kristin Lauter, Peter L. ...
ICCD
2001
IEEE
103views Hardware» more  ICCD 2001»
16 years 3 months ago
Improved ZDN-arithmetic for Fast Modulo Multiplication
In 1987 Sedlak proposed a modulo multiplication algorithm which is suitable for smart card implementation due to it’s low latency time. It is based on ZDN (zwei_drittel_N) arith...
Hagen Ploog, Sebastian Flügel, Dirk Timmerman...
FASE
2010
Springer
16 years 1 months ago
Evaluating Ordering Heuristics for Dynamic Partial-Order Reduction Techniques
Actor programs consist of a number of concurrent objects called actors, which communicate by exchanging messages. Nondeterminism in actors results from the different possible orde...
Steven Lauterburg, Rajesh K. Karmani, Darko Marino...
ATS
2009
IEEE
132views Hardware» more  ATS 2009»
16 years 1 months ago
On Improving Diagnostic Test Generation for Scan Chain Failures
In this paper, we present test generation procedures to improve scan chain failure diagnosis. The proposed test generation procedures improve diagnostic resolution by using multi-...
Xun Tang, Ruifeng Guo, Wu-Tung Cheng, Sudhakar M. ...
SEMCO
2009
IEEE
16 years 1 months ago
Ontology Extraction from Existing Educational Content to Improve Personalized e-Learning Experiences
Nowadays, the use of domain ontologies in e-Learning applications is rapidly increasing due to the important role they play in knowledge representation, sharing of didactical mate...
Nicola Capuano, Luca Dell'Angelo, Francesco Orciuo...