Sciweavers

193 search results - page 6 / 39
» Short Bases of Lattices over Number Fields
Sort
View
INDOCRYPT
2001
Springer
13 years 11 months ago
Elliptic Curves of Prime Order over Optimal Extension Fields for Use in Cryptography
We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Comple...
Harald Baier
AISC
2008
Springer
13 years 9 months ago
Parametric Linear Arithmetic over Ordered Fields in Isabelle/HOL
We use higher-order logic to verify a quantifier elimination procedure for linear arithmetic over ordered fields, where the coefficients of variables are multivariate polynomials o...
Amine Chaieb
NC
2006
132views Neural Networks» more  NC 2006»
13 years 7 months ago
Learning short multivariate time series models through evolutionary and sparse matrix computation
Multivariate Time Series (MTS) data are widely available in different fields including medicine, finance, bioinformatics, science and engineering. Modelling MTS data accurately is...
Stephen Swift, Joost N. Kok, Xiaohui Liu
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
13 years 11 months ago
Efficient Arguments without Short PCPs
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
APCCAS
2006
IEEE
292views Hardware» more  APCCAS 2006»
14 years 1 months ago
Another Look at the Sequential Multiplier over Normal Bases
—The Massey-Omura multiplier is a well-known sequential multiplier over finite fields GF(2m ), which can perform multiplication in m clock cycles for the normal basis. In this ar...
Zih-Heng Chen, Ming-Haw Jing, Trieu-Kien Truong, Y...