Sciweavers

62 search results - page 7 / 13
» Computable Ordered Abelian Groups and Fields
Sort
View
CRYPTO
2004
Springer
111views Cryptology» more  CRYPTO 2004»
14 years 1 months ago
Signed Binary Representations Revisited
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Sp...
IPPS
2003
IEEE
14 years 27 days ago
Some Modular Adders and Multipliers for Field Programmable Gate Arrays
This paper is devoted to the study of number representations and algorithms leading to efficient implementations of modular adders and multipliers on recent Field Programmable Ar...
Jean-Luc Beuchat
DATE
2006
IEEE
93views Hardware» more  DATE 2006»
14 years 1 months ago
Restructuring field layouts for embedded memory systems
In many computer systems with large data computations, the delay of memory access is one of the major performance bottlenecks. In this paper, we propose an enhanced field remappi...
Keoncheol Shin, Jungeun Kim, Seonggun Kim, Hwansoo...
CHI
2009
ACM
14 years 8 months ago
API usability: CHI'2009 special interest group meeting
Programmers of all types from novice end-user developers to professional software engineers make use of application programming interfaces (API) within their various designs. And,...
John M. Daughtry III, Umer Farooq, Jeffrey Stylos,...
JSC
2010
155views more  JSC 2010»
13 years 6 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan