Sciweavers

1795 search results - page 205 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
ISSAC
2007
Springer
147views Mathematics» more  ISSAC 2007»
14 years 4 months ago
Differential equations for algebraic functions
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their po...
Alin Bostan, Frédéric Chyzak, Bruno ...
PAIRING
2007
Springer
140views Cryptology» more  PAIRING 2007»
14 years 4 months ago
The Tate Pairing Via Elliptic Nets
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
Katherine E. Stange
ISCAS
2006
IEEE
163views Hardware» more  ISCAS 2006»
14 years 4 months ago
ASIC hardware implementation of the IDEA NXT encryption algorithm
— Symmetric-key block ciphers are often used to provide data confidentiality with low complexity, especially in the case of dedicated hardware implementations. IDEA NXT is a nov...
Marco Macchetti, Wenyu Chen
PDP
2006
IEEE
14 years 4 months ago
An O(n) Distributed Deadlock Resolution Algorithm
This paper shows a new distributed algorithm for deadlock detection and resolution under the single-resource request model that highly improves the complexity measurements of prev...
Manuel Prieto, Jesús E. Villadangos, Federi...
SAINT
2006
IEEE
14 years 4 months ago
A Prototype of a Secure Autonomous Bootstrap Mechanism for Control Networks
There are many kinds of control networks, which have been used in various non-IP network areas, such as BA (Building Automation), FA (Factory Automation) and PA (Process Automatio...
Nobuo Okabe, Shoichi Sakane, Masahiro Ishiyama, At...