Sciweavers

44 search results - page 6 / 9
» Finite Field Multiplier Using Redundant Representation
Sort
View
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
ICPR
2008
IEEE
14 years 9 months ago
EK-SVD: Optimized dictionary design for sparse representations
Sparse representations using overcomplete dictionaries are used in a variety of field such as pattern recognition and compression. However, the size of dictionary is usually a tra...
Raazia Mazhar, Paul D. Gader
ICIP
2009
IEEE
13 years 5 months ago
Dense disparity map representations for stereo image coding
Research in stereo image coding has focused on the disparity estimation/compensation process to exploit the cross-view redundancies. Most of the reported methods use a classical b...
Mounir Kaaniche, Wided Miled, Béatrice Pesq...
ANCS
2009
ACM
13 years 5 months ago
LaFA: lookahead finite automata for scalable regular expression detection
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 7 months ago
Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits
Abstract--We investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that a...
Theodoros K. Dikaliotis, Alexandros G. Dimakis, Tr...