Sciweavers

1405 search results - page 12 / 281
» We Are No Longer A Priesthood
Sort
View
PKC
2007
Springer
165views Cryptology» more  PKC 2007»
15 years 3 months 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
LCN
2005
IEEE
15 years 3 months ago
Effective Channel Time Analysis for Mobile Broadband Wireless Networks
— We describe an algorithm to estimate the future cell throughput of a multi-rate broadband wireless network based on previous measurements. The total throughput of a cell depend...
Dennis Pong, Tim Moors
IH
2004
Springer
15 years 2 months ago
Statistical Tools for Digital Forensics
A digitally altered photograph, often leaving no visual clues of having been tampered with, can be indistinguishable from an authentic photograph. As a result, photographs no longe...
Alin C. Popescu, Hany Farid
DAWAK
2009
Springer
15 years 2 months ago
Mining Violations to Relax Relational Database Constraints
Frequent constraint violations on the data stored in a database may suggest that the semantics of the represented reality is changing. In this work we propose a methodology and a t...
Mirjana Mazuran, Elisa Quintarelli, Rosalba Rossat...
ASPDAC
2008
ACM
116views Hardware» more  ASPDAC 2008»
14 years 11 months ago
Faster projection based methods for circuit level verification
As VLSI fabrication technology progresses to 65nm feature sizes and smaller, transistors no longer operate as ideal switches. This motivates the verification of digital circuits us...
Chao Yan, Mark R. Greenstreet