Hash ciphertext re-encryption method based on noise and decryption method after re-encryption

A re-encryption and noise technology, applied in the direction of public keys, instruments, and digital transmission systems for secure communication, can solve the problem of increased encryption and decryption overhead, and achieve the effect of small encryption and decryption overhead, enhanced encryption strength, and fast decryption.

Inactive Publication Date: 2014-07-23
XIAN UNIV OF SCI & TECH
View PDF6 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In addition, the existing technology encrypts the plaintext of the user to obtain the ciphertext. If the ciphertext is encrypted again

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
  • Hash ciphertext re-encryption method based on noise and decryption method after re-encryption
  • Hash ciphertext re-encryption method based on noise and decryption method after re-encryption

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0032] Example 1

[0033] like figure 1 As shown, the noise-based hash ciphertext re-encryption method of the present invention comprises the following steps:

[0034] Step 1: Set n static strategies for obtaining the first noise insertion position N1, and encode the n static strategies with 0 and a positive integer in sequence; where n is a natural number and 2≤n≤10; N1 is a natural number and N1

[0035] In this embodiment, the original hashed ciphertext is: af1460a7f2732e78165c5bcfce66769c, the length L3 of the original hashed ciphertext is 32, the user password string corresponding to the original hashed ciphertext is: myNewPassword, the user The length of the password string is 13;

[0036] In this embodiment, the value of n in step 1 is 3, and the three static strategies for obtaining the first noise insertion position N1 are: Type 1: the first noise insertion position N1 is the original has...

Example Embodiment

[0067] Example 2

[0068] like figure 1As shown, the noise-based hash ciphertext re-encryption method of the present invention comprises the following steps:

[0069] Step 1: Set n static strategies for obtaining the first noise insertion position N1, and encode the n static strategies with 0 and a positive integer in sequence; where n is a natural number and 2≤n≤10; N1 is a natural number and N1

[0070] In this embodiment, the original hashed ciphertext is: 26fa61d8e9a212eb79b87fa22983d18d, the length L3 of the original hashed ciphertext is 32, and the user password string corresponding to the original hashed ciphertext is: MYnEwPassword, the user The length of the password string is 13;

[0071] In this embodiment, the value of n in step 1 is 3, and the three static strategies for obtaining the first noise insertion position N1 are: Type 1: the first noise insertion position N1 is the original ...

Example Embodiment

[0102] Example 3

[0103] like figure 1 As shown, the noise-based hash ciphertext re-encryption method of the present invention comprises the following steps:

[0104] Step 1: Set n static strategies for obtaining the first noise insertion position N1, and encode the n static strategies with 0 and a positive integer in sequence; where n is a natural number and 2≤n≤10; N1 is a natural number and N1

[0105] In this embodiment, the original hash ciphertext is: 13DD9A82F226513CA7A50DCDCAB36BD2, the length L3 of the original hash ciphertext is 32, and the user password string corresponding to the original hash ciphertext is: MYNewPassword, the user The length of the password string is 13;

[0106] In this embodiment, the value of n in step 1 is 3, and the three static strategies for obtaining the first noise insertion position N1 are: Type 1: the first noise insertion position N1 is the original hash ...

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 discloses a Hash ciphertext re-encryption method based on noise and a decryption method after re-encryption. The re-encryption method comprises the steps of 1 setting a static strategy; 2 setting a dynamic strategy and selecting the static strategy; 3 dividing original Hash ciphertext into first front half Hash ciphertext and first rear half Hash ciphertext; 4 forming second front half Hash ciphertext or second rear half Hash ciphertext; 5 randomly generating a noise character string; 6 forming first rear half Hash ciphertext with noise or second rear half Hash ciphertext with noise; 7 generating first re-encrypted noise ciphertext or second re-encrypted noise ciphertext. The decryption method comprises the steps of 1 obtaining a first noise inserting position; 2 obtaining a second noise inserting position and the length of the noise character string; 3 forming the first rear half Hash ciphertext with noise; 4 forming first rear half Hash ciphertext; 5 generating decrypted original Hash ciphertext. The safety of the original Hash ciphertext can be improved, and the expenditure is low.

Description

technical field [0001] The invention belongs to the technical field of encryption, and in particular relates to a noise-based hash ciphertext re-encryption method and a decryption method after re-encryption. Background technique [0002] Existing techniques for encrypting user names include encryption methods such as MD5 and SHA. The main method of MD5 encryption is to hash and encrypt the user's plaintext to form ciphertext, and then store the ciphertext in the database. When the user logs in later, convert the password entered by the user into an MD5 code and compare it with the ciphertext stored in the database. Yes, the judgment is consistent. Although the 128-bit large integer of the password encrypted by MD5 cannot be decrypted mathematically, in other words, even if you see the source program and algorithm description, you cannot convert an MD5 value back to the original string, from Mathematically speaking, it is because there are infinitely many original strings, ...

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
IPC IPC(8): G06F21/62H04L9/30
CPCG06F21/602H04L9/3242
Inventor 龚星宇
Owner XIAN UNIV OF SCI & TECH
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
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap