Abstract

This paper develops an efficient pseudo-random number generator for validation of digital communication channels and secure disc. Drives. Simulation results validates the effectiveness of the random number generator.

Highlights

  • Digital data while transmission over communication channels becomes corrupted because of Inter Symbol Interference (ISI), Co-Channel Interference (CCI), multipath-fading etc

  • This paper develops an efficient pseudo-random number generator for validation of digital communication channels and secure disc

  • We show that disk drives can provide physical randomness for seeding generators for cryptographic random number, but they are targets to specific attacks, exploiting their use and special characteristics, leading to specific entropy requirements of the disk

Read more

Summary

Introduction

Digital data while transmission over communication channels becomes corrupted because of Inter Symbol Interference (ISI), Co-Channel Interference (CCI), multipath-fading etc. Previous data of the random number generator are difficult to store securely, because an attacker could read, and in some point in the future restore earlier states (together with any possible local authentication tags) with the help of specialized tools (spin stand), and so force the generation of the same random sequence as earlier. This may cause repeated nonces, of which recurring use of the same encryption keys, and so forth, that is, loss of security. These will provide confidence in the generated random numbers for their users, and tools for developers of embedded random number generators in testing and evaluation of designs

The Architecture
Entropy Requirements
Entropy Sources in Rotating Disc Drives
Timing Variations
Tracking Error
Channel Filter-Coefficients
Entropy Esimation
Data Dependencies
Coefficient Distribution
Autocorrelation of Sequences of Individual Coefficients
Entropy of Coefficients
Min Entropy The min-entropy is better for estimating the security:
Justification of the Mix-Truncate Entropy Estimation
Security of Hashed Seeding of Pseudorandom Number Generator
Randomness Tests
Accumulated Entropy
Compression of the HW Seed
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.