Sciweavers

128 search results - page 20 / 26
» Fast Integer Multiplication using Modular Arithmetic
Sort
View
CTRSA
2006
Springer
183views Cryptology» more  CTRSA 2006»
13 years 11 months 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
JCP
2007
104views more  JCP 2007»
13 years 7 months ago
Cyclic Convolution Algorithm Formulations Using Polynomial Transform Theory
— This work presents a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theo...
Abraham H. Diaz-Perez, Domingo Rodríguez
IJES
2008
102views more  IJES 2008»
13 years 7 months ago
Alternative application-specific processor architectures for fast arbitrary bit permutations
Block ciphers are used to encrypt data and provide data confidentiality. For interoperability reasons, it is desirable to support a variety of block ciphers efficiently. Of the bas...
Zhijie Jerry Shi, Xiao Yang, Ruby B. Lee
ACIVS
2006
Springer
14 years 1 months ago
Dedicated Hardware for Real-Time Computation of Second-Order Statistical Features for High Resolution Images
We present a novel dedicated hardware system for the extraction of second-order statistical features from high-resolution images. The selected features are based on gray level co-o...
Dimitris G. Bariamis, Dimitrios K. Iakovidis, Dimi...
SIGMETRICS
2008
ACM
13 years 7 months ago
DRAM is plenty fast for wirespeed statistics counting
Per-flow network measurement at Internet backbone links requires the efficient maintanence of large arrays of statistics counters at very high speeds (e.g. 40 Gb/s). The prevailin...
Bill Lin, Jun (Jim) Xu