Synthesis of Sources of Common Randomness Based on Keystream Generators with Shared Secret Keys

Dejan Cizelj, Milan Milosavljević, Jelica Radomirović (), Nikola Latinović, Tomislav Unkašević and Miljan Vučetić
Additional contact information
Dejan Cizelj: Vlatacom Institute of High Technology, Milutina Milankovica 5, 11070 Belgrade, Serbia
Milan Milosavljević: Vlatacom Institute of High Technology, Milutina Milankovica 5, 11070 Belgrade, Serbia
Jelica Radomirović: Vlatacom Institute of High Technology, Milutina Milankovica 5, 11070 Belgrade, Serbia
Nikola Latinović: Vlatacom Institute of High Technology, Milutina Milankovica 5, 11070 Belgrade, Serbia
Tomislav Unkašević: Vlatacom Institute of High Technology, Milutina Milankovica 5, 11070 Belgrade, Serbia
Miljan Vučetić: Vlatacom Institute of High Technology, Milutina Milankovica 5, 11070 Belgrade, Serbia

Mathematics, 2025, vol. 13, issue 15, 1-37

Abstract: Secure autonomous secret key distillation (SKD) systems traditionally depend on external common randomness (CR) sources, which often suffer from instability and limited reliability over long-term operation. In this work, we propose a novel SKD architecture that synthesizes CR by combining a keystream of a shared-key keystream generator K S G ( K G ) with locally generated binary Bernoulli noise. This construction emulates the statistical properties of the classical Maurer satellite scenario while enabling deterministic control over key parameters such as bit error rate, entropy, and leakage rate (LR). We derive a closed-form lower bound on the equivocation of the shared-secret key K G from the viewpoint of an adversary with access to public reconciliation data. This allows us to define an admissible operational region in which the system guarantees long-term secrecy through periodic key refreshes, without relying on advantage distillation. We integrate the Winnow protocol as the information reconciliation mechanism, optimized for short block lengths ( N = 8 ), and analyze its performance in terms of efficiency, LR, and final key disagreement rate (KDR). The proposed system operates in two modes: ideal secrecy, achieving secret key rates up to 22% under stringent constraints (KDR < 10 −5 , LR < 10 −10 ), and perfect secrecy mode, which approximately halves the key rate. Notably, these security guarantees are achieved autonomously, without reliance on advantage distillation or external CR sources. Theoretical findings are further supported by experimental verification demonstrating the practical viability of the proposed system under realistic conditions. This study introduces, for the first time, an autonomous CR-based SKD system with provable security performance independent of communication channels or external randomness, thus enhancing the practical viability of secure key distribution schemes.

Keywords: common randomness; secret key distillaton; information reconciliation; secret key equivocation; keystream generator; ideal secrecy; perfect secrecy (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/15/2443/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/15/2443/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:15:p:2443-:d:1712649

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().