Sciweavers

67 search results - page 8 / 14
» rsa 2010
Sort
View
RSA
2010
99views more  RSA 2010»
14 years 7 months ago
Hamiltonicity thresholds in Achlioptas processes
In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are pre...
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
RSA
2010
91views more  RSA 2010»
14 years 7 months ago
The second largest component in the supercritical 2D Hamming graph
The 2-dimensional Hamming graph H(2, n) consists of the n2 vertices (i, j), 1 ≤ i, j ≤ n, two vertices being adjacent when they share a common coordinate. We examine random sub...
Remco van der Hofstad, Malwina J. Luczak, Joel Spe...
PKC
2010
Springer
126views Cryptology» more  PKC 2010»
14 years 11 months ago
Implicit Factoring with Shared Most Significant and Middle Bits
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
Jean-Charles Faugère, Raphaël Marinier...
CTRSA
2010
Springer
216views Cryptology» more  CTRSA 2010»
15 years 4 months ago
Speed Records for NTRU
In this paper NTRUEncrypt is implemented for the first time on a GPU using the CUDA platform. As is shown, this operation lends itself excellently for parallelization and performs...
Jens Hermans, Frederik Vercauteren, Bart Preneel
GLOBECOM
2010
IEEE
14 years 7 months ago
Routing and Spectrum Allocation in OFDM-Based Optical Networks with Elastic Bandwidth Allocation
Orthogonal Frequency Division Multiplexing (OFDM) has been recently proposed as a modulation technique for optical networks, due to its good spectral efficiency and impairment tole...
Kostas Christodoulopoulos, Ioannis Tomkos, Emmanou...