Sciweavers

153 search results - page 29 / 31
» Efficient lattice-based signature scheme
Sort
View
CORR
2010
Springer
67views Education» more  CORR 2010»
13 years 7 months ago
Similarity-based Reasoning in Qualified Logic Programming
Similarity-based Logic Programming (briefly, SLP) has been proposed to enhance the LP paradigm with a kind of approximate reasoning which supports flexible information retrieval a...
Rafael Caballero, Mario Rodríguez-Artalejo,...
IJSN
2008
80views more  IJSN 2008»
13 years 7 months ago
Syntax vs. semantics: competing approaches to dynamic network intrusion detection
: Malicious network traffic, including widespread worm activity, is a growing threat to Internet-connected networks and hosts. In this paper, we consider two competing approaches t...
Walter J. Scheirer, Mooi Choo Chuah
CORR
2004
Springer
107views Education» more  CORR 2004»
13 years 7 months ago
Security of public key cryptosystems based on Chebyshev Polynomials
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...
Pina Bergamo, Paolo D'Arco, Alfredo De Santis, Lju...
EUROCRYPT
2006
Springer
13 years 11 months ago
The Function Field Sieve in the Medium Prime Case
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
Antoine Joux, Reynald Lercier
EUROCRYPT
2000
Springer
13 years 11 months ago
Computing Inverses over a Shared Secret Modulus
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
Dario Catalano, Rosario Gennaro, Shai Halevi