610 search results - page 86 / 122 » Fast Modular Reduction |
ISCAS
2005
IEEE
14 years 29 days ago
2005
IEEE
— The Complex Logarithmic Number System (CLNS) uses log/polar complex representation. We propose CLNS for the 128-point Fast Fourier Transform (FFT) in Orthogonal Frequency Divis...
EUROCRYPT
2004
Springer
14 years 23 days ago
2004
Springer
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in g...
WIA
2004
Springer
14 years 22 days ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
ACISP
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. At ACISP 2000, Yoo et al proposed a fast public key cryptosystem using matrices over a ring. The authors claim that the security of their system is based on the RSA probl...
ICCAD
2000
IEEE
13 years 11 months ago
2000
IEEE
In this paper, we propose a novel misted-bundle layout structure for minimizing inductive coupling noise. In this structure,we create severalrouting regions and re-order the routi...