Sciweavers

736 search results - page 102 / 148
» Algorithms for Ordinal Arithmetic
Sort
View
PKC
2005
Springer
93views Cryptology» more  PKC 2005»
14 years 2 months ago
Optimizing Robustness While Generating Shared Secret Safe Primes
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usabl...
Emil Ong, John Kubiatowicz
INDOCRYPT
2004
Springer
14 years 2 months ago
A Provably Secure Elliptic Curve Scheme with Fast Encryption
Abstract. We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure in the standard model. The scheme uses arithmetic modulo n2...
David Galindo, Sebastià Martín Molle...
IFL
2003
Springer
128views Formal Methods» more  IFL 2003»
14 years 1 months ago
With-Loop Scalarization - Merging Nested Array Operations
Construction of complex array operations by composition of more basic ones allows for abstract and concise specifications of algorithms. Unfortunately, na¨ıve compilation of suc...
Clemens Grelck, Sven-Bodo Scholz, Kai Trojahner
TACAS
2009
Springer
144views Algorithms» more  TACAS 2009»
14 years 1 months ago
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
Christoph Scholl, Stefan Disch, Florian Pigorsch, ...
DAC
1996
ACM
14 years 25 days ago
Bit-Level Analysis of an SRT Divider Circuit
Abstract-- It is impractical to verify multiplier or divider circuits entirely at the bit-level using ordered Binary Decision Diagrams (BDDs), because the BDD representations for t...
Randal E. Bryant