2009Telecommunication EngineeringRequires access

Encryption Algorithm Based on BWT and Symmetric Key

Jing Qing

Open publisher page 0 citations

Abstract

The order of plaintext is changed by BWT(Burrows-Wheeler Transformation),and the size of ciphertext is reduced by RLE(Run Length Encoding),then XOR operation with keys is executed. This is a data encryption algorithm based on symmetric key,which has strong anti-attack capability.

About this research paper

What this paper is about

The order of plaintext is changed by BWT(Burrows-Wheeler Transformation),and the size of ciphertext is reduced by RLE(Run Length Encoding),then XOR operation with keys is executed. This is a data encryption algorithm based on symmetric key,which has strong anti-attack capability.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The order of plaintext is changed by BWT(Burrows-Wheeler Transformation),and the size of ciphertext is reduced by RLE(Run Length Encoding),then XOR operation with keys is executed. This is a data encryption algorithm based on symmetric key,which has strong anti-attack capability.

Key concepts: Symmetric-key algorithm, Ciphertext, Plaintext, Encryption, Key (lock), Computer science, Encoding (memory), Plaintext-aware encryption

Related papers

Back to paper searchBrowse research topicsOriginal source
Encryption Algorithm Based on BWT and Symmetric Key — Research Paper | ScholarLens