Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

Improved RC5 encryption algorithm for secret key encryption

An encryption algorithm and key encryption technology, applied in the direction of encryption device with shift register/memory, etc., can solve the problem of large number of keys and low key confidentiality, and achieve less hardware resources, increase the difficulty of cracking, and eavesdropping. protective effect

Inactive Publication Date: 2014-07-02
HARBIN ENG UNIV
View PDF1 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] 1) Key agreement or issue, that is, how to send the encryption key to the decryption party through a reliable channel;
[0004] 2) The number of keys may be large: since the same key is used in encryption and decryption, one pair of communication requires one key, and an equal number of keys are required when there are multiple pairs of communication
Due to the use of symmetric keys, the confidentiality of the keys is not high

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Improved RC5 encryption algorithm for secret key encryption

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0016] The present invention is based on the following three number theory theorems.

[0017] Concept 1: It is a fact in number theory that it is easy to multiply two large prime numbers, but it is difficult to factor the resulting product.

[0018] Concept 2: Chinese Remainder Theorem: If the prime factors of N are P1*P2*...Pt, then the equation

[0019] wxya i =A i

[0020] There is only a unique solution X, X

[0021] Concept 3: In the set of integers Zn, if the following formula holds, the numbers a and b are additive inverses of each other and uniquely exist,

[0022] a+b≡0(modn)

[0023] Such as figure 1 As shown, the binary number of the plaintext to be encrypted is divided into two parts A and B; S[] is the key array, and the elements in it are the subkeys for each encryption; add A and S[0] to get C , add B and S[1] to get D, and then start cyclic encryption, and the encryption times are r; the encryption process of each round is the sam...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to an improved RC5 encryption algorithm for secret key encryption. The improved RC5 encryption algorithm comprises the steps of dividing a binary number of a cleartext to be encrypted into A and B equally; enabling S[] to represent for a secret key array, and enabling the element in the bracket to represent for a subkey to be encrypted every time; adding A to S[0] to get C, adding B to S[1] to get D, and then performing cycle encryption for r times; enabling all the encryption processes to be the same, namely moving E obtained by bitwise exclusive-OR of C and D for D bites leftwards, and then adding E to S[2i] ( i= 1, 2, ...) to get F; moving G obtained by bitwise exclusive-OR of D and F for F bites leftwards, and then adding G to S[2i+ 1] ( i= 1, 2, ...) to get H; acquiring F and H for one round of encryption, and then assigning F and H to C and D; repeating the above algorithm for r rounds to complete cleartext encryption; encrypting the secret key S[], during encryption, fetching two big prime numbers firstly to obtain an encryption mark C and operators m and n, and performing encryption on S[i] according to the formula of S[i]+ C= 0[ mod(m*n)].

Description

technical field [0001] The invention relates to an improved RC5 encryption algorithm for key encryption. Background technique [0002] The existing RC5 algorithm is a kind of symmetric encryption algorithm. Its main features are high encryption efficiency and strong flexibility. It is very suitable for use on devices with small memory, which ensures the feasibility of this algorithm in embedded applications. The shortcomings of the algorithm are: [0003] 1) Key agreement or issue, that is, how to send the encryption key to the decryption party through a reliable channel; [0004] 2) The number of keys can be large: since the same key is used in encryption and decryption, one key is required for one pair of communication, and an equal number of keys are required when there are multiple pairs of communication. Due to the use of symmetric keys, the secrecy of the keys is not high. Contents of the invention [0005] The purpose of the present invention is to provide an imp...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04L9/06
Inventor 张兰勇刘胜李冰许长魁
Owner HARBIN ENG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Eureka Blog
Learn More
PatSnap group products

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