Journal of information and communication convergence engineering

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지

A High-Security RSA Cryptoprocessor Embedded with an Efficient MAC Unit

  • Moon, Sang-Ook (Department of Electronic Engineering, Mokwon University)
  • Published : 2009.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

RSA crypto-processors equipped with more than 1024 bits of key space handle the entire key stream in units of blocks. The RSA processor which will be the target design in this paper defines the length of the basic word as 128 bits, and uses an 256-bits register as the accumulator. For efficient execution of 128-bit multiplication, 32b*32b multiplier was designed and adopted and the results are stored in 8 separate 128-bit registers according to the status flag. In this paper, an efficient method to execute 128-bit MAC (multiplication and accumulation) operation is proposed. The suggested method pre-analyzed the all possible cases so that the MAC unit can remove unnecessary calculations to speed up the execution. The proposed architecture prototype of the MAC unit was automatically synthesized, and successfully operated at 20MHz, which will be the operation frequency in the RSA processor.

Keywords

References

  1. William Stallings, Cryptography and network security principles and practie, 3rd Edition, (c) 003 by Pearson Education, Inc
  2. J. L. Hennessy and D. A. Patterson, "Computer Architecture : A Quantiative Approach, 3rd edition", Morgan Kaufmann Publishers, CA, 2003
  3. Douglas R. Stinson, Cryptography Theory and Practice 2nd Edition (c) 2002 by Chapman & Hall/CRC
  4. T. Izu and B. Moller, "Improved Parallel Elliptic Curve Multiplication Method Resistant againstSide Channel Attacks", LNCS 2551, pp.296-313, 2002 https://doi.org/10.1007/3-540-36231-2_24
  5. A. J. Menezes, P. C. van Oorschot, S. A. Vanstone, Handbook of Applied Cryptography, CRC press, 1997
  6. R. L. Rivest, A. Shamir, and L. M. Adleman, "A Method for Obtaining Digital Signatures and Public-key Cryptosystems," Communications of the ACM, Vol. 21, pp. 120-126, Feb. 1978 https://doi.org/10.1145/359340.359342
  7. P. L. Montgomery, "Modular multiplication without trial division," Math. Comput., 44, pp. 519-521, 1985 https://doi.org/10.2307/2007970