EconPapers    
Economics at your fingertips  
 

One Class of Ideally Secret Autonomous Symmetric Ciphering Systems Based on Wiretap Polar Codes

Milan Milosavljević, Jelica Radomirović (), Tomislav Unkašević and Boško Božilović
Additional contact information
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
Tomislav Unkašević: Vlatacom Institute of High Technology, Milutina Milankovica 5, 11070 Belgrade, Serbia
Boško Božilović: Vlatacom Institute of High Technology, Milutina Milankovica 5, 11070 Belgrade, Serbia

Mathematics, 2024, vol. 12, issue 23, 1-24

Abstract: This paper introduces a class of symmetric ciphering systems with a finite secret key, which provides ideal secrecy, autonomy in key generation and distribution, and robustness against the probabilistic structure of messages (the Ideally Secret Autonomous Robust (ISAR) system). The ISAR system is based on wiretap polar codes constructed over an artificial wiretap channel with a maximum secrecy capacity of 0.5. The system autonomously maintains a minimum level of key equivocation by continuously refreshing secret keys without additional key generation and distribution infrastructure. Moreover, it can transform any stream ciphering system with a finite secret key of known length into an ISAR system without knowing and/or changing its algorithm. Therefore, this class of system strongly supports privacy, a critical requirement for contemporary security systems. The ISAR system’s reliance on wiretap polar coding for strong secrecy ensures resistance to passive known plaintext attacks. Furthermore, resistance to passive attacks on generated refreshing keys follows directly from ideal secrecy and autonomy. The results presented offer an efficient methodology for synthesizing this class of systems with predetermined security margins and a complexity of the order of n log ⁡ n , where n is the block length of the applied polar code.

Keywords: cryptography; ideal secrecy; polar coding; wiretap channel; key equivocation; privacy amplification (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/23/3724/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/23/3724/ (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:12:y:2024:i:23:p:3724-:d:1530957

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 ().

 
Page updated 2025-03-19
Handle: RePEc:gam:jmathe:v:12:y:2024:i:23:p:3724-:d:1530957