[PDF][PDF] Lightweight PUF-based key and random number generation
A Van Herrewege - Ph. D. dissertation, 2015 - esat.kuleuven.be
In this rst section, we explain three cryptographic primitives: symmetric cryptography,
asymmetric cryptography, and hash functions. Most, if not all, cryptographic protocols require
one or more of these primitives. For each of these primitives, we give a typical use case
example, which demonstrates the importance of two components that are often overlooked
or (falsely) assumed present: secure keys and a strong random number generator.
asymmetric cryptography, and hash functions. Most, if not all, cryptographic protocols require
one or more of these primitives. For each of these primitives, we give a typical use case
example, which demonstrates the importance of two components that are often overlooked
or (falsely) assumed present: secure keys and a strong random number generator.
以上显示的是最相近的搜索结果。 查看全部搜索结果