610 search results - page 7 / 122 » Fast Modular Reduction |
INFORMATICALT
2006
13 years 7 months ago
2006
We know the necessity for information security becomes more widespread in these days, especially for hardware-based implementations such as smart cards chips for wireless applicati...
ICCD
2001
IEEE
14 years 4 months ago
2001
IEEE
In 1987 Sedlak proposed a modulo multiplication algorithm which is suitable for smart card implementation due to it’s low latency time. It is based on ZDN (zwei_drittel_N) arith...
CHES
2004
Springer
14 years 22 days ago
2004
Springer
We present an implementation of elliptic curves and of hyperelliptic curves of genus 2 and 3 over prime fields. To achieve a fair comparison between the different types of groups,...
CHES
2003
Springer
14 years 17 days ago
2003
Springer
Abstract. Efficient implementations of RSA on computationally limited devices, such as smartcards, often use the CRT technique in combination with Garner’s algorithm in order to ...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Most of the faster community extraction algorithms are based on the Clauset, Newman and Moore (CNM), which is employed for networks with sizes up to 500,000 nodes. The modificatio...