Sciweavers

18306 search results - page 62 / 3662
» Algorithmics in Exponential Time
Sort
View
GLVLSI
2003
IEEE
166views VLSI» more  GLVLSI 2003»
15 years 3 months ago
Exponential split accumulator for high-speed reduced area low-power direct digital frequency synthesizers
A new split accumulator architecture to be used in direct digital frequency synthesizers (DDFS) systems is presented. This new design eliminates the need of adders on the section ...
Edward Merlo, Kwang-Hyun Baek, Myung-Jun Choe
PKC
2001
Springer
111views Cryptology» more  PKC 2001»
15 years 2 months ago
Cryptanalysis of PKP: A New Approach
Quite recently, in [4], a new time-memory tradeoff algorithm was presented. The original goal of this algorithm was to count the number of points on an elliptic curve, however, th...
Éliane Jaulmes, Antoine Joux
CCCG
1998
14 years 11 months ago
Proximity drawings of binary trees in polynomial area
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
Paolo Penna, Paola Vocca
ECCC
2000
93views more  ECCC 2000»
14 years 9 months ago
Security of the Most Significant Bits of the Shamir Message Passing Scheme
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
Maria Isabel Gonzalez Vasco, Igor Shparlinski
STOC
2007
ACM
136views Algorithms» more  STOC 2007»
15 years 10 months ago
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, ...