A new (n,n) Blockcipher based Hash Function for Short Messages

抄録

We propose a new (n, n) double block length hash function where collision and preimage security bound is respectively O(2^<tn>) and O(2^<2tn>). The strategic point of this scheme is able to handle short message tn (t < 1) bit, which is very significant issue for RFID tag security. It is known that the RFID tag needs to proceed short message but MDC-2, MDC-4, MJH are not properly suitable for meeting this criteria due to their constructions where these schemes can handle message size n bit (n = 128). Additionally the security bound of the proposed scheme is better than other (n, n) blockcipher based hash such as MDC-2, MDC-4, MJH and as well as obtaining higher efficient rate.

identifier:https://dspace.jaist.ac.jp/dspace/handle/10119/12377

収録刊行物

詳細情報 詳細情報について

  • CRID
    1050011097144432512
  • NII論文ID
    120006675662
  • Web Site
    http://hdl.handle.net/10119/12377
  • 本文言語コード
    en
  • 資料種別
    conference paper
  • データソース種別
    • IRDB
    • CiNii Articles

問題の指摘

ページトップへ