Sciweavers

9049 search results - page 288 / 1810
» The New C Standard
Sort
View
PKC
2007
Springer
165views Cryptology» more  PKC 2007»
16 years 24 days ago
Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi's RSA
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
Noboru Kunihiro, Kaoru Kurosawa
CCIA
2005
Springer
16 years 4 days ago
Automatic discovery of synonyms and lexicalizations from the Web
The search of Web resources is a very important topic due to the huge amount of valuable information available in the WWW. Standard search engines can be a great help but they are ...
David Sánchez, Antonio Moreno
CEAS
2004
Springer
16 years 2 days ago
IP Addresses in Email Clients
IP addresses are an important tool for fighting spam, used for safe lists, blackhole lists, anti-spoofing and related purposes. While it is trivial to find the sender’s IP add...
Joshua Goodman
GECCO
2004
Springer
117views Optimization» more  GECCO 2004»
16 years 1 days ago
Comparing Search Algorithms for the Temperature Inversion Problem
Several inverse problems exist in the atmospheric sciences that are computationally costly when using traditional gradient based methods. Unfortunately, many standard evolutionary ...
Monte Lunacek, L. Darrell Whitley, Philip Gabriel,...
172
Voted
EUROCRYPT
2001
Springer
15 years 11 months ago
Practical Threshold RSA Signatures without a Trusted Dealer
We propose a threshold RSA scheme which is as efficient as the fastest previous threshold RSA scheme (by Shoup), but where two assumptions needed in Shoup’s and in previous schem...
Ivan Damgård, Maciej Koprowski