-
1
-
-
0017930809
-
A method for obtaining digital signatures and public-key cryptosystems
-
R.L. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems," Communications of the ACM, vol. 21, pp. 120-126, 1978.
-
(1978)
Communications of the ACM
, vol.21
, pp. 120-126
-
-
Rivest, R.L.1
Shamir, A.2
Adleman, L.3
-
2
-
-
84966243285
-
Modular multiplication without trial division
-
P.L. Montgomery, "Modular Multiplication without Trial Division," Mathematics of Computation, vol. 44, no. 170, pp. 519-521, 1985.
-
(1985)
Mathematics of Computation
, vol.44
, Issue.170
, pp. 519-521
-
-
Montgomery, P.L.1
-
3
-
-
0003683288
-
High-speed RSA implementation
-
RSA Laboratories, RSA Data Security, Inc.
-
Ç.K. Koç, "High-Speed RSA Implementation," Technical Report, RSA Laboratories, RSA Data Security, Inc., 1994.
-
(1994)
Technical Report
-
-
Koç, Ç.K.1
-
5
-
-
0000094920
-
Systolic modular multiplication
-
C. Walter, "Systolic Modular Multiplication," IEEE Transactions on Computers, vol. 42(3), pp. 376-378, 1993.
-
(1993)
IEEE Transactions on Computers
, vol.42
, Issue.3
, pp. 376-378
-
-
Walter, C.1
-
6
-
-
84888068366
-
Two implementation methods of a 1024-bit RSA cryptoprocessor based on modified montgomery algorithm
-
T. W. Kwon, C. S. You, W. S. Heo, Y. K. Rang, and J. R. Choi. "Two Implementation Methods of a 1024-bit RSA Cryptoprocessor Based on Modified Montgomery Algorithm," IEEE International Symposium on Circuits and Systems (ISCAS), vol. 4, pp. 650-653, 2001.
-
(2001)
IEEE International Symposium on Circuits and Systems (ISCAS)
, vol.4
, pp. 650-653
-
-
Kwon, T.W.1
You, C.S.2
Heo, W.S.3
Rang, Y.K.4
Choi, J.R.5
-
7
-
-
0035692339
-
High-speed modular multiplication algorithm for RSA cryptosystem
-
K.S. Cho, J.H. Ryu and J.D. Cho, "High-Speed Modular Multiplication Algorithm for RSA Cryptosystem," IECON, pp. 479-483, 2001.
-
(2001)
IECON
, pp. 479-483
-
-
Cho, K.S.1
Ryu, J.H.2
Cho, J.D.3
-
8
-
-
0035390239
-
High radix montgomery modular exponentiation on reconfigurable hardware
-
T. Blum and C. Paar, "High Radix Montgomery Modular Exponentiation on Reconfigurable Hardware," IEEE Transactions on Computers, vol. 50, no.7, pp. 759-764, 2001.
-
(2001)
IEEE Transactions on Computers
, vol.50
, Issue.7
, pp. 759-764
-
-
Blum, T.1
Paar, C.2
-
9
-
-
0036385605
-
Efficient architectures for implementing montgomery modular multiplication and RSA modular exponentiation on reconfigurable logic
-
ACM Press, New York, NY, USA
-
A. Daly and W. Marnane, "Efficient Architectures for Implementing Montgomery Modular Multiplication and RSA Modular Exponentiation on Reconfigurable Logic," International Symposium on Field Programmable Gate Arrays, ACM Press, New York, NY, USA, pp. 40-49, 2002.
-
(2002)
International Symposium on Field Programmable Gate Arrays
, pp. 40-49
-
-
Daly, A.1
Marnane, W.2
|