Sciweavers

3454 search results - page 121 / 691
» Modern computer algebra
Sort
View
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 10 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
STACS
1999
Springer
15 years 10 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
GLOBECOM
2008
IEEE
16 years 21 days ago
Small Logarithmic S-Boxes for Small Ciphers
-- The substitution box (S-Box) is one of the most important components in modern ciphers. This paper reports a new class of S-Boxes defined by the logarithmic functions in GF(16)....
Xian Liu
CHES
2008
Springer
108views Cryptology» more  CHES 2008»
15 years 8 months ago
Exploiting the Power of GPUs for Asymmetric Cryptography
Modern Graphics Processing Units (GPU) have reached a dimension with respect to performance and gate count exceeding conventional Central Processing Units (CPU) by far. Many modern...
Robert Szerwinski, Tim Güneysu
BIB
2008
93views more  BIB 2008»
15 years 6 months ago
A structured approach for the engineering of biochemical network models, illustrated for signalling pathways
Quantitative models of biochemical networks (signal transduction cascades, metabolic pathways, gene regulatory circuits) are a central component of modern systems biology. Buildin...
Rainer Breitling, David Gilbert, Monika Heiner, Ri...