Dictionary-Based BPT Compression with Trimodal Encryption for Efficient Fiber-Optic Data Management and Security
- Title
- Dictionary-Based BPT Compression with Trimodal Encryption for Efficient Fiber-Optic Data Management and Security
- Creator
- Alapatt B.P.; Poonia R.C.; Singh C.
- Description
- Fiber-optic transmission systems are capable of carrying tens of terabits per second of traffic and thereby form the core infrastructure for all Internet-based services and applications. While fiber-optic communication provides rapid data transfer, it faces the challenge of managing the substantial data volumes generated, stored, or transmitted. In the realm of fiber-optic communication, data interception is straightforward, necessitating robust security measures. One effective solution is compression-based encryption, which combines security with data compression benefits. Encryption safeguards data by transforming it into ciphertext during transmission, rendering it unreadable to attackers without knowledge of the encryption method. Data compression enhances bandwidth efficiency, enabling the efficient transmission of large data volumes using limited bandwidth. In the event of data compromise, attackers must grasp both compression and encryption methods to decipher the information, adding an additional layer of security. In this paper, an encoding technique named the Bounded Probability-Based Textual Data Compression (BPT) algorithm is introduced with trimodal encryption method for securing the short textual data while transferring from source to the destination. The BPT algorithm creates a codeword using a dictionary that assigns binary codes according to character occurrence probabilities in the input data. To decompress, the coding table must be transmitted alongside the compressed data. The trimodal encryption is used as a second tier for securing the data that was compressed using BPT algorithm. The trimodal encryption employs three encryption methods, and data is encrypted using one of these methods during transmission to the destination. The BPT algorithms performance is evaluated using benchmark textual datasets from the Calgary Corpus and the Canterbury Corpus. The experimental results demonstrate the unique characteristics of the BPT algorithm, including compression ratio (CR), compression factor (CF), bits per character (BPC), and space savings. Additionally, the Trimodal encryption algorithm (TME) method is evaluated using end-to-end delay analysis, packet loss analysis, and packet delivery ratio assessment. The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.
- Source
- Smart Innovation, Systems and Technologies, Vol-392 SIST, pp. 641-658.
- Date
- 2024-01-01
- Publisher
- Springer Science and Business Media Deutschland GmbH
- Subject
- Bounded Probability-Based Textual Data Compression; BPC; Compression factor; Compression ratio; End-to-end delay; PDR; PLR; Textual dataset
- Coverage
- Alapatt B.P., CHRIST (Deemed to be University), Delhi NCR, India; Poonia R.C., CHRIST (Deemed to be University), Delhi NCR, India; Singh C., CHRIST (Deemed to be University), Delhi NCR, India
- Rights
- Restricted Access
- Relation
- ISSN: 21903018; ISBN: 978-981973689-8
- Format
- Online
- Language
- English
- Type
- Conference paper
Collection
Citation
Alapatt B.P.; Poonia R.C.; Singh C., “Dictionary-Based BPT Compression with Trimodal Encryption for Efficient Fiber-Optic Data Management and Security,” CHRIST (Deemed To Be University) Institutional Repository, accessed February 25, 2025, https://archives.christuniversity.in/items/show/19124.