Sciweavers

125 search results - page 4 / 25
» All Secrets Great and Small
Sort
View
DCC
2003
IEEE
14 years 5 months ago
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
Phong Q. Nguyen, Igor Shparlinski

Presentation
945views
13 years 3 months ago
On the use of discrete Pascal transform in hiding data in images
The Discrete Pascal Transform (DPT) has been proved remarkably useful for edge detection, filter design, discrete-time signal interpolation and data hiding. In the present work a n...
GD
2000
Springer
13 years 9 months ago
Fast Layout Methods for Timetable Graphs
Abstract. Timetable graphs are used to analyze transportation networks. In their visualization, vertex coordinates are fixed to preserve the underlying geography, but due to small ...
Ulrik Brandes, Galina Shubina, Roberto Tamassia, D...
ICNP
2000
IEEE
13 years 10 months ago
Hop Integrity in Computer Networks
A computer network is said to provide hop integrity iff when any router p in the network receives a message m supposedly from an adjacent router q, then p can check that m was ind...
Mohamed G. Gouda, E. N. Elnozahy, Chin-Tser Huang,...
IWDW
2004
Springer
13 years 11 months ago
Alteration-Locating Authentication Watermarking for Binary Images
Abstract. In image authentication watermarking, hidden data is inserted into an image to detect any accidental or malicious image alteration. In the literature, quite a small numbe...
Hae Yong Kim, Ricardo L. de Queiroz