← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

11 第11章 散列表

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.689Z

nction family, with individual hash functions determined by parameters a, b, t, r, and m.

The (approximate) 5-independence of the wee hash function family for variable-length inputs can be argued based on the assumption that the 1-word wee hash function is a random oracle and on the security of the cipher-block-chaining message authentication code (CBC-MAC), as studied by Bellare et al. [42].

The case here is actually simpler than that studied in the literature, since if two messa

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter011.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea