Sciweavers

1400 search results - page 51 / 280
» On multiplication in finite fields
Sort
View
SIAMADS
2010
122views more  SIAMADS 2010»
13 years 3 months ago
Local/Global Analysis of the Stationary Solutions of Some Neural Field Equations
Neural or cortical fields are continuous assemblies of mesoscopic models, also called neural masses, of neural populations that are fundamental in the modeling of macroscopic parts...
Romain Veltz, Olivier D. Faugeras
JBI
2008
13 years 8 months ago
The Field Representation Language
The complexity of quantitative biomedical models, and the rate at which they are published, is increasing to a point where managing the information has become all but impossible w...
Guy Tsafnat
ASAP
2010
IEEE
315views Hardware» more  ASAP 2010»
13 years 6 months ago
A compact FPGA-based architecture for elliptic curve cryptography over prime fields
Abstract--This paper proposes an FPGA-based applicationspecific elliptic curve processor over a prime field. This research targets applications for which compactness is more import...
Jo Vliegen, Nele Mentens, Jan Genoe, An Braeken, S...
CTRSA
2006
Springer
183views Cryptology» more  CTRSA 2006»
14 years 13 days ago
Efficient Doubling on Genus 3 Curves over Binary Fields
The most important and expensive operation in a hyperelliptic curve cryptosystem (HECC) is scalar multiplication by an integer k, i.e., computing an integer k times a divisor D on ...
Xinxin Fan, Thomas J. Wollinger, Yumin Wang
VLSI
2010
Springer
13 years 7 months ago
Design of low-complexity and high-speed digital Finite Impulse Response filters
—In this paper, we introduce a design methodology to implement low-complexity and high-speed digital Finite Impulse Response (FIR) filters. Since FIR filters suffer from a larg...
Diego Jaccottet, Eduardo Costa, Levent Aksoy, Paul...