메뉴 건너뛰기




Volumn 17, Issue 3, 1998, Pages 265-272

Reversible data mixing procedure for efficient public-key encryption

Author keywords

Asymmetric key; Data mixing; Encryption; Hash function; Symmetric key

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA PROCESSING; SECURITY OF DATA;

EID: 0031624340     PISSN: 01674048     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-4048(98)80340-4     Document Type: Article
Times cited : (5)

References (7)
  • 3
    • 0042520555 scopus 로고    scopus 로고
    • Asymmetric encryption: Evolution and enhancements
    • Spring
    • D. Johnson, and S. M. Matyas, "Asymmetric Encryption: Evolution and Enhancements," CryptoBytes, vol. 2, no. 1, pp. 2-6, Spring 1996.
    • (1996) CryptoBytes , vol.2 , Issue.1 , pp. 2-6
    • Johnson, D.1    Matyas, S.M.2
  • 4
    • 84899748328 scopus 로고    scopus 로고
    • Encryption of long blocks using a short-block encryption procedure
    • November
    • D. Johnson, S. M. Matyas, and M. Peyravian, "Encryption of Long Blocks Using a Short-Block Encryption Procedure," Contribution to IEEE P1363, November 1996.
    • (1996) Contribution to IEEE P1363
    • Johnson, D.1    Matyas, S.M.2    Peyravian, M.3
  • 6
    • 0042019717 scopus 로고    scopus 로고
    • IBM T.J. Watson Research Center,Yorktown Heights, N.Y., 10598, Research Report RC 20674, December
    • D. Coppersmith, "Luby-Rackoff: Four Rounds is not Enough," IBM T.J. Watson Research Center,Yorktown Heights, N.Y., 10598, Research Report RC 20674, December, 1996.
    • (1996) Luby-Rackoff: Four Rounds is Not Enough
    • Coppersmith, D.1


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