Sciweavers

610 search results - page 14 / 122
» Fast Modular Reduction
Sort
View
BMCBI
2008
102views more  BMCBI 2008»
13 years 7 months ago
Fast splice site detection using information content and feature reduction
Background: Accurate identification of splice sites in DNA sequences plays a key role in the prediction of gene structure in eukaryotes. Already many computational methods have be...
A. K. M. A. Baten, Saman K. Halgamuge, Bill C. H. ...
ALGORITHMICA
1999
58views more  ALGORITHMICA 1999»
13 years 7 months ago
Reductions Do Not Preserve Fast Convergence Rates in Average Time
Jay Belanger, Aduri Pavan, Jie Wang
CHES
2007
Springer
126views Cryptology» more  CHES 2007»
14 years 1 months ago
How to Maximize the Potential of FPGA Resources for Modular Exponentiation
This paper describes a modular exponentiation processing method and circuit architecture that can exhibit the maximum performance of FPGA resources. The modular exponentiation arch...
Daisuke Suzuki
IPL
1998
177views more  IPL 1998»
13 years 7 months ago
A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation
A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...
JaeCheol Ha, Sang-Jae Moon