메뉴 건너뛰기




Volumn 2247, Issue , 2001, Pages 50-61

Incremental Hash function based on pair chaining and modular arithmetic combining

Author keywords

Cryptography; Hash function; Incremental cryptography

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; CRYPTOGRAPHY;

EID: 23044533188     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45311-3_5     Document Type: Conference Paper
Times cited : (10)

References (9)
  • 6
    • 0001143795 scopus 로고    scopus 로고
    • Efficient Cryptographic Schemes Provably as Secure as Subset Sum
    • Autumn 1996
    • Impagliazzo, R., Naor, M. (1996). Efficient Cryptographic Schemes Provably as Secure as Subset Sum. Journal of Cryptology, Vol. 9, No.4, Autumn 1996
    • (1996) Journal of Cryptology , vol.9 , Issue.4
    • Impagliazzo, R.1    Naor, M.2


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