메뉴 건너뛰기




Volumn 435 LNCS, Issue , 1990, Pages 175-185

Batch RSA

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 84921021973     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/0-387-34805-0_17     Document Type: Conference Paper
Times cited : (84)

References (18)
  • 2
    • 0023985196 scopus 로고
    • RSA and Rabin Functions: Certain Parts are as Hard as the Whole
    • April
    • Alexi, W., Chor, B., Goldreich, O., and Schnorr, C.P., RSA and Rabin Functions: Certain Parts are as Hard as the Whole, SIAM J. Comput., April, 1988.
    • (1988) SIAM J. Comput
    • Alexi, W.1    Chor, B.2    Goldreich, O.3    Schnorr, C.P.4
  • 5
    • 0021522644 scopus 로고
    • How to generate Cryptographically Strong Sequences of Pseudo-Random Bits
    • Blum, M. and Micali, S., How to generate Cryptographically Strong Sequences of Pseudo-Random Bits, SIAM J. Comp., 13, 1984.
    • (1984) SIAM J. Comp , pp. 13
    • Blum, M.1    Micali, S.2
  • 6
    • 0041937636 scopus 로고    scopus 로고
    • An Efficient Probabilistic Public Key Encryption Scheme which Hides all Partial Information
    • Blum, M. and Goldwasser, S., An Efficient Probabilistic Public Key Encryption Scheme which Hides all Partial Information, Proceedings of Crypto’ 84.
    • Proceedings of Crypto’ 84
    • Blum, M.1    Goldwasser, S.2
  • 9
    • 84874800178 scopus 로고
    • A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
    • El Gamal, T., A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Transactions on Information Theory, Vol IT-31, 1985.
    • (1985) IEEE Transactions on Information Theory , vol.IT-31
    • El Gamal, T.1
  • 10
    • 33746337429 scopus 로고    scopus 로고
    • How to Prove Yourself: Practical Solutions to Identification and Signature Problems
    • Fiat, A., and Shamir, A., How to Prove Yourself: Practical Solutions to Identification and Signature Problems, Proceedings of Crypto’ 86.
    • Proceedings of Crypto’ 86
    • Fiat, A.1    Shamir, A.2
  • 12
    • 0003094772 scopus 로고    scopus 로고
    • On using RSA with Low Exponent in a Public Key Network
    • Håstad, J., On using RSA with Low Exponent in a Public Key Network, Proceedings of Crypto’ 85.
    • Proceedings of Crypto’ 85
    • Håstad, J.1
  • 13
    • 0003294665 scopus 로고
    • The Art of Computer Programming
    • 2nd ed., Addison-Wesley
    • Knuth, D., The Art of Computer Programming, vol. 2: Seminumerical Algorithms, 2nd ed., Addison-Wesley, 1981.
    • (1981) Seminumerical Algorithms , vol.2
    • Knuth, D.1
  • 15
    • 0020194569 scopus 로고
    • Fast decipherment algorithm for RSA public-key cryptosystem
    • Quisquater, J.-J. and Couvreur, C, Fast decipherment algorithm for RSA public-key cryptosystem, Electronic letters, vol. 18, 1982, pp. 905-907.
    • (1982) Electronic Letters , vol.18 , pp. 905-907
    • Quisquater, J.-J.1    Couvreur, C.2
  • 17
    • 0017930809 scopus 로고
    • A Method for Obtaining Digital Signatures and Public Key Cryptosystems
    • Rivest, R.L., Shamir, A. and Adleman, L., A Method for Obtaining Digital Signatures and Public Key Cryptosystems, Comm. ACM, Vol. 21, No. 2, 1978.
    • (1978) Comm. ACM , vol.21 , Issue.2
    • Rivest, R.L.1    Shamir, A.2    Adleman, L.3
  • 18
    • 38049015677 scopus 로고
    • On the Generation of Cryptographically Strong Pseudorandom Sequences
    • Shamir, A., On the Generation of Cryptographically Strong Pseudorandom Sequences, ACM Trans. on Computer Systems, Vol. 1, No. 1, 1983.
    • (1983) ACM Trans. on Computer Systems , vol.1 , Issue.1
    • Shamir, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.