Sciweavers

22 search results - page 4 / 5
» rsa 2002
Sort
View
RSA
2002
69views more  RSA 2002»
13 years 7 months ago
On the covariance of the level sizes in random recursive trees
In this paper we study the covariance structure of the number of nodes k and l steps away from the root in random recursive trees. We give an analytic expression valid for all k, ...
Remco van der Hofstad, Gerard Hooghiemstra, Piet V...
RSA
2002
81views more  RSA 2002»
13 years 7 months ago
Decycling numbers of random regular graphs
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
Sheng Bau, Nicholas C. Wormald, Sanming Zhou
CTRSA
2007
Springer
112views Cryptology» more  CTRSA 2007»
14 years 1 months ago
Directed Transitive Signature Scheme
In 2002, Micali and Rivest raised an open problem as to whether directed transitive signatures exist or not. In 2003, Hohenberger formalized the necessary mathematical criteria for...
Xun Yi
CHES
2003
Springer
119views Cryptology» more  CHES 2003»
14 years 20 days ago
Faster Double-Size Modular Multiplication from Euclidean Multipliers
Abstract. A novel technique for computing a 2n-bit modular multiplication using n-bit arithmetic was introduced at CHES 2002 by Fischer and Seifert. Their technique makes use of an...
Benoît Chevallier-Mames, Marc Joye, Pascal P...
NDSS
2002
IEEE
14 years 10 days ago
Performance Analysis of TLS Web Servers
TLS is the protocol of choice for securing today’s ecommerce and online transactions, but adding TLS to a web server imposes a significant overhead relative to an insecure web ...
Cristian Coarfa, Peter Druschel, Dan S. Wallach