Improving multiplication and reminder using implementation based on word and index

asynchronous cryptography is one of the most widely used cryptographic algorithms. Much research has been done to find other applications of this cryptography method. Modular exponentiation is one of the primitive operations in these algorithms. Since we need to perform multiplication, square and modular division, most aspects of these studies were based on optimizing each of these algorithms. Since access to faster software or hardware techniques was the objective of these studies, after studying optimized implementation methods of multiplication and division, we tried to take a step toward the application of methods of software implementation of some examples to decrease implementation time and increase the efficiency of algorithms of this type in this paper.

[1]  Nadia Nedjah,et al.  Hardware simulation model suitable for recursive computations: Karatsuba-Ofman's multiplication algorithm , 2003 .

[2]  Blakely.  A Computer Algorithm for Calculating the Product AB Modulo M , 1983, IEEE Transactions on Computers.

[3]  G. Doroeviae,et al.  Optimization of modular reduction procedure in RSA algorithm implementation on assembler of TMS320C54x signal processors , 2002, 2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628).

[4]  P. L. Montgomery.  Modular multiplication without trial division , 1985 .

[5]  Dan Zuras.  On squaring and multiplying large integers , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

[6]  Jens Köplinger,et al.  Elliptic complex numbers with dual multiplication , 2010, Appl. Math. Comput..

[7]  Jae-Yong Lim,et al.  Subcritical multiplication factor and source efficiency in accelerator-driven system , 2010 .

[8]  Paul Barrett,et al.  Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor , 1986, CRYPTO.

[9]  Kenneth R. Sloan.  Comments on "A Computer Algorithm for Calculating the Product AB Modulo M" , 1985, IEEE Trans. Computers.

[10]  Legendre polynomials and complex multiplication, I , 2010 .

[11]  Gary Wayne Bewick.  Fast Multiplication: Algorithms and Implementations , 1994 .

[12]  G. R. Blakley,et al.  A Computer Algorithm for Calculating the Product AB Modulo M , 1983, IEEE Trans. Computers.

[13]  J. Quisquater,et al.  Fast decipherment algorithm for RSA public-key cryptosystem , 1982 .

[14]  Andrew D. Booth,et al.  A SIGNED BINARY MULTIPLICATION TECHNIQUE , 1951 .

[15]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[16]  Ernest F. Brickell,et al.  Fast Exponentiation with Precomputation (Extended Abstract) , 1992, EUROCRYPT.

[17]  Denis Laurichesse,et al.  Optimized implementation of RSA cryptosystem , 1991, Comput. Secur..

[18]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[19]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[20]  Ernest F. Brickell,et al.  A Fast Modular Multiplication Algorithm With Application To Two Key Cryptography , 1982, CRYPTO.