Name: Cryptographic Hash and Integrity Protection
Brand: University of Colorado System
Availability: OnlineOnly
Rating: 4.6 (12 reviews)

返回到 Cryptographic Hash and Integrity Protection

学生对 University of Colorado System 提供的 Cryptographic Hash and Integrity Protection 的评价和反馈

4.6

星

91 个评分

课程概述

Welcome to Cryptographic Hash and Integrity Protection! This course reviews cryptographic hash functions in general and their use in the forms of hash chain and hash tree (Merkle tree). Building on hash functions, the course describes message authentication focusing on message authentication code (MAC) based on symmetric keys. We then discuss digital signatures based on asymmetric cryptography, providing security properties such as non-repudiation which were unavailable in symmetric-cryptography-based message authentication. This course is a part of the Applied Cryptography specialization....

1 - Cryptographic Hash and Integrity Protection 的 12 个评论（共 12 个）

创建者 SAI S K

•

Jun 12, 2020

course is excellent and I hope it would be better if there is an advanced level specialisation continuation for this specialisation

创建者 Rizwan K

•

Nov 13, 2024

Very helpful course to learn Cryptography..! and Sang-Yoon Chang is a nice teacher.

创建者 Sebastian C

•

Jun 2, 2021

Great theory. Professor is also super clear in his explanations.

Recommended :)

创建者 Adri J J J

•

May 25, 2020

One of the best courses on hashing in cryptography...

创建者 Mohamed T

•

Jun 19, 2018

Excellent course

创建者 Izzatbek A

•

Oct 23, 2024

best course

创建者 Og'abek A

•

Apr 16, 2025

Thank you

创建者 Samsung A

•

Mar 22, 2025

good

创建者 Lincoln A

•

Nov 29, 2021

This is a very solid course but the "peer grading" requirement needs to be changed. I finished the course on the first or second day of November and had to log on multiple times a day every day until now (Nov 29) to finally get my peer reviews done. The course clearly does not have enough traffic to justify every student doing 3 peer reviews. The requirement should be definitely be reduced - at least to 2 and possibly all the way to one.