Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

RSA ciphering method for realizing quick big prime generation

An encryption method and prime number generation technology, applied in key distribution, can solve the problems of long operation time, slow system running speed, long time, etc., and achieve the effect of improving processing speed and stability

Active Publication Date: 2010-01-06
SHENZHEN SINOSUN TECH
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The defect of this method for generating large prime numbers in the prior art is that for embedded systems with limited computing power, the probabilistic primality detection algorithm widely used at present such as the Miller-rabin algorithm itself has a long computing time, and large In most cases, it is necessary to search for hundreds or even thousands of random numbers before finding a large prime number, that is, to execute the primality detection algorithm hundreds or even thousands of times, so it will often take a long time to generate a large prime number during the encryption calculation process, causing the system The running speed is very slow and the system efficiency drops

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
  • RSA ciphering method for realizing quick big prime generation
  • RSA ciphering method for realizing quick big prime generation

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0024] Various preferred embodiments of the present invention will be described in more detail below in conjunction with the accompanying drawings.

[0025] The cryptographic calculation implementation process of the present invention includes: the system automatically calculates when idle, generates more than two prime numbers, and stores them in the prime number buffer; Prime numbers p and q, and use these two prime numbers to generate an RSA key, for example, calculate the RSA public key n=p*q; generate a random number e, so that e and (p-1)(q-1) are mutually prime, and e is also public key; calculate RSA private key d=e -1 mod(p-1)(q-1), and then output the key to the user; the user invokes the function of loading the key of the system, and the system stores the key input by the user in the key buffer; the user invokes the encryption function of the system, The system takes out the key from the key cache, encrypts and calculates the plaintext input by the user, and output...

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 prime number (PN) generation flow is that: The system generates a random number during idle, checks it with the Fermats theorem algorithm. If it is a PN, rechecks it with the Miller-rabin algorithm. If it still is, stores it into buffer for later use; if it is not, continues to circulate with preset longer step length. Whenever the system needs PN for encrypting, it picks them up from buffers. This invention uses the check method combining the Fermats theorem algorithm and the Miller-rabin algorithm and utilizes system idle time. These raise the processing speed and reliability.

Description

technical field [0001] The invention belongs to the field of cryptographic calculation, in particular to the field of cryptographic calculation design applied to embedded systems. Background technique [0002] In the encryption implementation process of the prior art, especially in the design of the implementation scheme of public key encryption, it is often necessary to provide the function of generating large prime numbers. For example, the key parameters p and q in the RSA encryption process must be prime numbers. [0003] For generating a large prime number, the usual implementation scheme in the embedded system of the prior art is: at first generate a random number with sufficient length, then judge whether the random number is a prime number by utilizing the probabilistic primality detection algorithm, if the random number is not a prime number, Then regenerate another set of random numbers, or moderately transform the current random number, such as adding 2 to the ran...

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 Patents(China)
IPC IPC(8): H04L9/08
Inventor 张玮张璐
Owner SHENZHEN SINOSUN TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap 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