Modular reduction is the basic building block of many publickey cryptosystems. BCH codes require repeated polynomial reductions modulo the same constant polynomial. This is conceptually very similar to the implementation of public-key cryptography where repeated modular reduction in Zn or Zp are required for some fixed n or p. It is hence natural to try and transfer the modular reduction expert...

A majority of server applications such as web server, database, E-mail, storage, etc. process a lot of network data, making them very network I/O intensive. TCP/IP is the most commonly used network protocol by these applications. TCP/IP runs over Ethernet, which is the de-facto Local Area Network (LAN) protocol. Rapid growth of Internet-enabled applications has resulted in development of faster...

This paper addresses the residual scaling techniques (coarse-grid-correction optimization techniques) in multigrid methods. We survey recent developments in this area and prove the equivalence of the over-weighted residual technique and the over-correction technique. This leads to the proof of mathematical equivalence of the pre-scaling and post-scaling acceleration techniques. Two theorems hav...

Many techniques for the acceleration and deceleration of industrial robots and computer numerical control (CNC) machine tools have been proposed in order to make industrial robots and CNC machine tools perform given tasks efficiently. Although the techniques selecting polynomial functions can generate various acceleration and deceleration characteristics, the major problem is the computational ...