Appendix 13 · New Encryption Methods for QKD and RKD
This appendix expands the book's discussion of encryption methods for QKD and RKD. It starts from the strict one-time-pad requirements: truly random key bits, key length at least as large as the plaintext, and no reuse. It then explains why these requirements quickly become difficult when QKD or RKD key rates are limited.
The appendix presents several modes designed to reduce the practical pressure on key volume. These methods use cyclic buffers, counters, hash functions such as HKDF or SHAKE256, and XOR operations to derive encryption material for data blocks. They are tailored to QKD and RKD because these technologies already rely on XOR and hashing in related processing steps.
The material is careful about the security trade-off. The pure one-time pad remains the reference point for provable confidentiality, while the presented modes are practical alternatives for cases where enough fresh key material cannot be generated or distributed. The appendix is therefore relevant for realistic deployments where key rate is the bottleneck.
- Explains one-time-pad key-length constraints
- Presents XOR-based modes for QKD and RKD
- Uses cyclic buffers, counters, and hash functions
- Addresses practical limits of physical key rates
- Distinguishes ideal OTP security from usable variants