메뉴 건너뛰기




Volumn 169, Issue 1, 2005, Pages 51-61

A research on new public-key encryption schemes

Author keywords

Discrete logarithm; Integer factorization; Lucas sequence; Probabilistic public key encryption scheme

Indexed keywords

ALGORITHMS; DECISION MAKING; PROBABILISTIC LOGICS; PROBLEM SOLVING; SECURITY OF DATA; SEMANTICS;

EID: 27144479202     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2004.10.038     Document Type: Article
Times cited : (3)

References (12)
  • 1
    • 21344498336 scopus 로고
    • A subexponential algorithm over all finite fields
    • Advances in Cryptology-CRYPTO'93 Springer-Verlag
    • M. Adleman, J. DeMarrais, A subexponential algorithm over all finite fields, Advances in Cryptology-CRYPTO'93, LNCS 773, Springer-Verlag, 1993, pp. 147-158.
    • (1993) LNCS , vol.773 , pp. 147-158
    • Adleman, M.1    Demarrais, J.2
  • 2
    • 84957663622 scopus 로고
    • Some remarks on Lucas-based cryptosystems
    • advances in cryptology-CRYPTO'95 Springer-Verlag
    • D. Bleichenbacher, W. Bosma, A.K. Lenstra, Some Remarks on Lucas-based cryptosystems, advances in cryptology-CRYPTO'95, LNCS 963, Springer-Verlag, 1995, pp. 386-396.
    • (1995) LNCS , vol.963 , pp. 386-396
    • Bleichenbacher, D.1    Bosma, W.2    Lenstra, A.K.3
  • 3
    • 84947778144 scopus 로고    scopus 로고
    • The decision Diffie-Hellman problem
    • Third Algorithmic Number Theory Symposium Springer-Verlag
    • D. Boneh, The decision Diffie-Hellman problem, in: Third Algorithmic Number Theory Symposium, LNCS 1423, Springer-Verlag, 1998, pp. 48-63.
    • (1998) LNCS , vol.1423 , pp. 48-63
    • Boneh, D.1
  • 4
    • 24144447463 scopus 로고    scopus 로고
    • Doing more with fewer bits
    • Advances in Cryptology-ASIACRYPT'99
    • A.E. Brouwer, R. Pellikaan, E.R. Verheul, Doing more with fewer bits, Advances in Cryptology-ASIACRYPT'99, LNCS 1716, vol. 15, pp. 321-332.
    • LNCS 1716 , vol.15 , pp. 321-332
    • Brouwer, A.E.1    Pellikaan, R.2    Verheul, E.R.3
  • 8
    • 31144478622 scopus 로고    scopus 로고
    • Efficient public-key cryptosystems provably secure against active adversaries
    • K. Y. Lam et al. (Eds.), Asiacrypt'99
    • P. Paillier, D. Pointcheval, Efficient public-key cryptosystems provably secure against active adversaries. in: K. Y. Lam et al. (Eds.), Asiacrypt'99, Springer LNCS 1716, 1999, pp. 169-179.
    • (1999) Springer LNCS , vol.1716 , pp. 169-179
    • Paillier, P.1    Pointcheval, D.2
  • 9
    • 0017930809 scopus 로고
    • A method for obtaining digital signatures and public-key cryptosystems
    • R. Rivest, A. Shamir, and L. Adleman A method for obtaining digital signatures and public-key cryptosystems Comm. ACM 21 20 1978 120 126
    • (1978) Comm. ACM , vol.21 , Issue.20 , pp. 120-126
    • Rivest, R.1    Shamir, A.2    Adleman, L.3
  • 10
    • 27144449235 scopus 로고
    • LUC: A new public-key system
    • Elsevier Science Publications
    • P. Smith, M. Lennon, LUC: A new public-key system. Proceeding of IFIP/Sec'93, Elsevier Science Publications, 1994.
    • (1994) Proceeding of IFIP/Sec'93
    • Smith, P.1    Lennon, M.2
  • 11
    • 0027650333 scopus 로고
    • Common-multiplicand multiplication and its applications to public key cryptography
    • S.M. Yen, and C.S. Laih Common-multiplicand multiplication and its applications to public key cryptography Electron Lett. 29 17 1993 1583 1584
    • (1993) Electron Lett. , vol.29 , Issue.17 , pp. 1583-1584
    • Yen, S.M.1    Laih, C.S.2
  • 12
    • 0029277753 scopus 로고
    • Fast algorithms for LUC digital signature computation
    • S.M. Yen, and C.S. Laih Fast algorithms for LUC digital signature computation IEE Proc. Comput. Digit. Tech. 142 2 1995 165 169
    • (1995) IEE Proc. Comput. Digit. Tech. , vol.142 , Issue.2 , pp. 165-169
    • Yen, S.M.1    Laih, C.S.2


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