Sciweavers

313 search results - page 10 / 63
» Solving Structured Polynomial Systems and Applications to Cr...
Sort
View
ASAP
2008
IEEE
199views Hardware» more  ASAP 2008»
13 years 10 months ago
An efficient method for evaluating polynomial and rational function approximations
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented method for evaluating elementary functions using polynomial and rational functio...
Nicolas Brisebarre, Sylvain Chevillard, Milos D. E...
ACNS
2009
Springer
113views Cryptology» more  ACNS 2009»
14 years 21 days ago
Fast Packet Classification Using Condition Factorization
Abstract. Rule-based packet classification plays a central role in network intrusion detection systems such as Snort. To enhance performance, these rules are typically compiled int...
Alok Tongaonkar, R. Sekar, Sreenaath Vasudevan
ASIACRYPT
2000
Springer
14 years 1 months ago
Cryptanalysis of the TTM Cryptosystem
Abstract. In 1985 Fell and Diffie proposed constructing trapdoor functions with multivariate equations [11]. They used several sequentially solved stages. Another idea of building ...
Louis Goubin, Nicolas Courtois
TIM
2010
144views Education» more  TIM 2010»
13 years 3 months ago
Extending Polynomial Chaos to Include Interval Analysis
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
Antonello Monti, Ferdinanda Ponci, Marco Valtorta
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
14 years 21 days ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas