Sciweavers

814 search results - page 23 / 163
» Analysis of Modular Arithmetic
Sort
View
CAV
2000
Springer
125views Hardware» more  CAV 2000»
15 years 1 months ago
Efficient Reachability Analysis of Hierarchical Reactive Machines
Hierarchical state machines is a popular visual formalism for software specifications. To apply automated analysis to such specifications, the traditional approach is to compile th...
Rajeev Alur, Radu Grosu, Michael McDougall
CORR
2007
Springer
173views Education» more  CORR 2007»
14 years 10 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
CAV
2008
Springer
105views Hardware» more  CAV 2008»
14 years 12 months ago
THOR: A Tool for Reasoning about Shape and Arithmetic
We describe Thor (Tool for Heap-Oriented Reasoning), a tool based on separation logic that is capable of reasoning automatically about heap-manipulating programs. There are several...
Stephen Magill, Ming-Hsien Tsai, Peter Lee, Yih-Ku...
ESAS
2007
Springer
15 years 4 months ago
Enabling Full-Size Public-Key Algorithms on 8-Bit Sensor Nodes
Abstract. In this article we present the fastest known implementation of a modular multiplication for a 160-bit standard compliant elliptic curve (secp160r1) for 8-bit micro contro...
Leif Uhsadel, Axel Poschmann, Christof Paar
ANTS
2010
Springer
263views Algorithms» more  ANTS 2010»
15 years 1 months ago
Computing Automorphic Forms on Shimura Curves over Fields with Arbitrary Class Number
We extend methods of Greenberg and the author to compute in the cohomology of a Shimura curve defined over a totally real field with arbitrary class number. Via the Jacquet-Langlan...
John Voight