Cryptography – Particular algorithmic function encoding – Public key
Reexamination Certificate
2011-03-08
2011-03-08
Jung, David Y (Department: 2431)
Cryptography
Particular algorithmic function encoding
Public key
C380S028000, C713S189000
Reexamination Certificate
active
07903814
ABSTRACT:
In one embodiment, cryptographic transformation of a message is performed by first performing a table initiation phase to populate a data structure. Then, a first random number multiplied by a public key is added to each value in the data structure, in modulo of a second random number multiplied by the public key. Then an exponentiation phase is performed, wherein each modular multiplication and square operation in the exponentiation phase is performed in modulo of the second random number multiplied by the public key, producing a result. Then the result of the exponentiation phase is reduced in modulo of the public key. The introduction of the random numbers aids in the prevention of potential security breaches from the deduction of operands in the table initiation phase by malicious individuals.
REFERENCES:
Modified Montgomery modular multiplication and RSA exponentiation techniques; McIvor, C.; McLoone, M.; McCanny, J.V.; Computers and Digital Techniques, IEE Proceedings -; vol. 151 , Issue: 6; Publication Year: 2004 , pp. 402-408.
Hardware design for end-to-end modular exponentiation in redundant number representation; Sanu, M.O.; Swartzlander, E.E., Jr.; Signal Processing Systems Design and Implementation, 2005. IEEE Workshop on; Publication Year: 2005 , pp. 65-69.
A New Modular Exponentiation Architecture for Efficient Design of RSA Cryptosystem; Ming-Der Shieh; Jun-Hong Chen; Hao-Hsuan Wu; Wen-Ching Lin; Very Large Scale Integration (VLSI) Systems, IEEE Transactions on vol. 16 , Issue: 9; Publication Year: 2008 , pp. 1151-1161.
Schindler, W., “A Combined Timing and Power Attack”, Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography, Feb. 12-14, 2002. D. Naccache and P. Paillier (Eds.): PKC 2002, LNCS 2274, pp. 263-279, 2002.
Schindler et al., “More Detail for a Combined Timing and Power Attack against Implementations of RSA”, 9th IMA International Conferences on Cryptography and Coding, K.G. Paterson (Ed.): Cryptography and Coding 2003, LNCS 2898, pp. 245-263, 2003.
Walter et al., “Distinguishing Exponent Digits by Observing Modular Subtractions”, D. Naccache (Ed.): CT-RSA 2001, LNCS 2020, pp. 192{207, 2001.
Aciicmez Onur
Ma Qingwei
Seifert Jean-Pierre
Zhang Xinwen
Beyer Law Group LLP
Jung David Y
Samsung Electronics Co,. Ltd.
LandOfFree
Enhancing the security of public key cryptosystem... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Enhancing the security of public key cryptosystem..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enhancing the security of public key cryptosystem... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2717712