메뉴 건너뛰기




Volumn 11, Issue 4, 2000, Pages 435-440

A New Redundancy Reducing Cipher

Author keywords

Cryptography; Data encryption standard (DES); Huffman coding

Indexed keywords


EID: 0346438816     PISSN: 08684952     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (4)

References (6)
  • 1
    • 0022712202 scopus 로고
    • Data compression with huffman coding
    • Amsterdam, J. (1986). Data compression with huffman coding. Byte, 11, 98.
    • (1986) Byte , vol.11 , pp. 98
    • Amsterdam, J.1
  • 3
    • 84938015047 scopus 로고
    • A method for the construction of minimum redundancy codes
    • Huffman, D. (1952). A method for the construction of minimum redundancy codes. Proc. Inst. Radio Engrs, 40, 1098-1101.
    • (1952) Proc. Inst. Radio Engrs , vol.40 , pp. 1098-1101
    • Huffman, D.1
  • 4
    • 0000370732 scopus 로고    scopus 로고
    • A new dynamic cryptographic key generation scheme in a hierarchy
    • Hwang, M.S. (1999). A new dynamic cryptographic key generation scheme in a hierarchy. Nordic Journal of Computing, 6, 363-371.
    • (1999) Nordic Journal of Computing , vol.6 , pp. 363-371
    • Hwang, M.S.1
  • 6
    • 0347163612 scopus 로고
    • A redundancy reducing cipher
    • Wayner, P. (1988). A redundancy reducing cipher. Cryptologia, 12, 107-112.
    • (1988) Cryptologia , vol.12 , pp. 107-112
    • Wayner, P.1


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