Results 181 to 190 of about 3,908 (215)
Some of the next articles are maybe not open access.
An iterative modular multiplication algorithm in RNS
Applied Mathematics and Computation, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jen-Ho Yang +2 more
openaire +2 more sources
A radix-4 modular multiplication hardware algorithm efficient for iterative modular multiplications
[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic, 2002A fast radix-4 modular multiplication hardware algorithm is proposed. It is efficient especially in applications, such as encryption/decryption in the RSA cryptosystem, where modular multiplications are carried out iteratively. Each subtraction for the division for residue calculation is embedded in the repeated multiply-addition.
openaire +1 more source
A Hardware Algorithm for Modular Multiplication/Division
IEEE Transactions on Computers, 2005A mixed radix-4/2 algorithm for modular multiplication/division suitable for VLSI implementation is proposed. The algorithm is based on Montgomery method for modular multiplication and on the extended Binary GCD algorithm for modular division. Both algorithms are modified and combined into the proposed algorithm so that almost all the hardware ...
Marcelo E. Kaihara, Naofumi Takagi
openaire +1 more source
New iterative algorithms for modular multiplication
Signal Processing, 2004The new modular multiplier structures proposed in this paper are based on a short precision magnitude comparison instead of the full magnitude comparison operation. Another feature of these structures is that the comparison operations are carried out first.
Nibouche, O. +2 more
openaire +2 more sources
Evolution of multiple gaits for modular robots
2016 IEEE Symposium Series on Computational Intelligence (SSCI), 2016Modular robots are composed of many elementary mechatronic modules that can be connected to form a robot body of various shapes. This feature allows such a robot to adapt for a given task and particular environment. A motion of the modular robot is based on control of individual angles between the modules, and the robot locomotion can be realized using
Vojtech Vonásek, Jan Faigl
openaire +1 more source
The continuous multiple‐modular design problem
Naval Research Logistics Quarterly, 1983AbstractIn this article we extend our previous work on the continuous single‐module design problem to the multiple‐module case. It is assumed that there is a fixed cost associated with each additional module used. The Kuhn–Tucker conditions characterize local optima among which there is a global optimum.
Shaftel, Timothy L., Thompson, Gerald L.
openaire +1 more source
Hardware Complexity of Modular Multiplication and Exponentiation
IEEE Transactions on Computers, 2007Large integer modular multiplication (MM) and modular exponentiation (ME) are the foundation of most public-key cryptosystems, specifically RSA, Diffie-Helleman, EIGamal, and the elliptic curve cryptosystems. Thus, MM algorithms have been studied widely and extensively.
Jean-Pierre David +2 more
openaire +1 more source
Fast modular multiplication by operand changing
International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004., 2004A new algorithm for modular multiplication for public key cryptography is presented. The algorithm is optimised with respect to area and time by use of a combination of adders and fast lookup tables. This leads to a multiplication method that can significantly speed up exponentiation, because the values of the lookup table do not depend on the operands
Manfred Schimmler, Viktor Bunimov
openaire +1 more source
Modularization of xcsf for multiple output dimensions
Proceedings of the 13th annual conference on Genetic and evolutionary computation, 2011XCSF approximates function surfaces by evolving a suitable clustering of the input space, so that a simple -- typically linear -- predictor yields sufficient accuracy in each cluster. With an increasing number of distinct output dimensions, however, the accuracy of local predictions typically decreases.
Martin V. Butz, Patrick O. Stalph
openaire +1 more source
Modular Addition and Multiplication
2020This chapter consists of two sections that cover algorithms and hardware architectures for modular addition and multiplication: (x + y) mod m and xy mod m. Subtraction and division are also included—as the addition of an inverse and as multiplication by an inverse. The underlying algorithms and hardware structures are those of Chap.
openaire +1 more source