Sciweavers

525 search results - page 87 / 105
» The Davies-Murphy Power Attack
Sort
View
ICISC
2000
126views Cryptology» more  ICISC 2000»
13 years 11 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...
ACL
1996
13 years 11 months ago
Linguistic Structure as Composition and Perturbation
This paper discusses the problem of learning language from unprocessed text and speech signals, concentrating on the problem of learning a lexicon. In particular, it argues for a ...
Carl de Marcken
AAAI
1990
13 years 11 months ago
A Proven Domain-Independent Scientific Function-Finding Algorithm
Programs such as Bacon, Abacus, Coper, Kepler and others are designed to find functional relationships of scientific significance in numerical data without relying on the deep dom...
Cullen Schaffer
TPDS
2008
133views more  TPDS 2008»
13 years 9 months ago
A More Practical Approach for Single-Packet IP Traceback using Packet Logging and Marking
Tracing IP packets back to their origins is an important step in defending the Internet against denial-of-service (DoS) attacks. Two kinds of IP traceback techniques have been prop...
Chao Gong, Kamil Saraç
TCS
2002
13 years 9 months ago
Authentication tests and the structure of bundles
Suppose a principal in a cryptographic protocol creates and transmits a message containing a new value v, later receiving v back in a different cryptographic context. It can concl...
Joshua D. Guttman, F. Javier Thayer