Sciweavers

17 search results - page 3 / 4
» Redundant Trinomials for Finite Fields of Characteristic 2
Sort
View
DCC
2008
IEEE
14 years 10 months ago
On solving sparse algebraic equations over finite fields
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
Igor Semaev
ANCS
2009
ACM
13 years 8 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 10 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...
CRYPTO
1991
Springer
150views Cryptology» more  CRYPTO 1991»
14 years 1 months ago
CM-Curves with Good Cryptographic Properties
Our purpose is to describe elliptic curves with complex multiplication which in characteristic 2 have the following useful properties for constructing Diffie-HeUman type cryptosys...
Neal Koblitz
IPMI
2003
Springer
14 years 11 months ago
Learning Object Correspondences with the Observed Transport Shape Measure
Abstract. We propose a learning method which introduces explicit knowledge to the object correspondence problem. Our approach uses an a priori learning set to compute a dense corre...
Alain Pitiot, Hervé Delingette, Arthur W. T...