Encryption method based on cycle queue shift rule
An encryption method and circular queue technology, applied to the usage of multiple keys/algorithms, etc., can solve the problems of low encryption strength, low speed, and poor operability, and achieve high encryption strength, simple transformation, and fast encryption and decryption speed
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0027] An encryption method based on circular queue shifting rules is as follows:
[0028] Step 1] The user inputs integers m and n, and fills the plaintext information to be encrypted into the m×n matrix from left to right and from top to bottom to form a plaintext information matrix A;
[0029] Step 2] Create a sequence of random integers X = {r ∈ N, r ≤ max(m, n)};
[0030] Step 3] The user inputs an integer w as the number of matrix transformations according to the encryption strength requirements;
[0031] Step 4] random number k is randomly selected in random integer sequence X, and operation k=k mod 5;
[0032] When k=0, take 4 random numbers L from the random integer sequence X 1 , L 2 , L 3 , L 4 , requiring L 1 3 ≤m,L 2 4 ≤n; then the Lth 1 line as the starting line, with the Lth 3 line as the end line, with the Lth 2 column as the starting column, with the Lth 4 column as the end column, construct the transformation matrix A', record the operation process...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com