A note on practical key derivation functions (情報処理)
スポンサーリンク
概要
- 論文の詳細を見る
In this article, we first review key derivation functions by Krawczyk and in NISTSP 800-108. Then, we propose parallelizable key derivation functions obtained by modifying or using the existing schemes. We also define two measures of efficiency of key derivation functions, and evaluate their performance in terms of the two measures.
- 社団法人電子情報通信学会の論文
- 2010-02-25
著者
-
Hirose Shoichi
Graduate School of Engineering, The University of Fukui
-
Hirose Shoichi
Graduate School Of Engineering The Univ. Of Fukui
-
Hirose Shoichi
Graduate School Of Engineering University Of Fukui
関連論文
- Differentiability of four prefix-free PGV hash functions
- Sequential Bitwise Sanitizable Signature Schemes
- Weak Security Notions of Cryptographic Unkeyed Hash Functions and Their Amplifiability(Symmetric Key Cryptography)(Cryptography and Information Security)
- A note on practical key derivation functions (情報処理)
- A Note on the Strength of Weak Collision Resistance(Discrete Mathematics and Its Applications)
- An Approximate Scheme of Oblivious Transfer with Probabilistic Receipt (Information Security)
- An Approximate Scheme of Oblivious Transfer with Probabilistic Receipt
- A note on practical key derivation functions (情報セキュリティ)
- Cancellation Moderating Factor Control for DS-CDMA Non-linear Interference Canceller with Antenna Diversity Reception(Wireless Communication Technology, Multi-dimensional Mobile Information Networks)
- Multistage Interference Canceller Combined with Adaptive Array Antenna for DS-CDMA System(Special Section on Multi-dimensional Mobile Information Networks)
- Efficient Pseudorandom-Function Modes of a Block-Cipher-Based Hash Function
- Collision Resistance of Double-Block-Length Hash Function against Free-Start Attack
- Sequential Bitwise Sanitizable Signature Schemes
- A-7-1 Related-Key Cube Attack on KATAN48
- A Note on Practical Key Derivation Functions
- An AES Based 256-bit Hash Function for Lightweight Applications: Lesamnta-LW
- Collision Resistance of Hash Functions in a Weak Ideal Cipher Model
- An AES Based 256-bit Hash Function for Lightweight Applications : Lesamnta-LW
- A Block-Cipher-Based Hash Function Using an MMO-Type Double-Block Compression Function
- A Block-Cipher-Based Hash Function Using an MMO-Type Double-Block Compression Function
- A Block-Cipher-Based Hash Function Using an MMO-Type Double-Block Compression Function
- Lightweight Hashing Mode Using Lesamnta-LW Compression Function and MDP Domain Extension
- Multilane Hashing Mode Suitable for Parallel Processing
- Lightweight Hashing Mode Using Lesamnta-LW Compression Function and MDP Domain Extension (ライフインテリジェンスとオフィス情報システム)