Quick large number decomposition method based on cryptographic technology application

A cryptography and technology technology, applied in the fields of information security and cryptography technology application, to achieve the effect of rapid decomposition

Inactive Publication Date: 2012-11-07
刘诗章 +2
View PDF3 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although the above-mentioned attempts to decompose the factors have been successful, the complexity and difficulty of its cracking can also be seen from this
However, at present, there is no algorithm that can completely solve the problem of large number decomposition. Most of the above-mentioned alg

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
  • Quick large number decomposition method based on cryptographic technology application
  • Quick large number decomposition method based on cryptographic technology application
  • Quick large number decomposition method based on cryptographic technology application

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0040] Attached below figure 1 and figure 2 The present invention is described in further detail with specific embodiment; According to appended figure 1 process and attached figure 2 The working principle diagram of the application example of fast decomposition of a large number:

[0041] (1) Determine the large number to be decomposed as M=10 10 +1;

[0042] (2) Substitute into the formula: 10 10 +1=30(n-1)+a, wherein, what n represents is the number of columns of the large number M in the almost prime number family table, and what a represents is the first position of the row where the large number M is in the almost prime number family table number;

[0043] (3) Calculate (10 10 +1) / 30=333333333+11 / 30, thereby determining that the position of this value M in the possible prime number table is: n=333333334 columns, a=a 3 =11, that is, the value is on the line whose first digit is "11";

[0044] (4) start calculation deletion program, delete the composite number c...

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 quick large number decomposition method based on cryptographic technology application. The creative quick large number decomposition method organically combining the congruence theory and the composite number distribution rule includes the steps of compressing positive integers, setting up an almost prime number group, selecting a maximum dereferencing range, generating the almost prime number group, decomposing a large number, setting digits, deleting composite numbers and the like. The method different from traditional large number decomposition methods can be used for quick factorization of any large number selected from n without depending on computing speed, and quick decomposition can be realized by using computer software for simple identification processing instead of a great amount of time-consuming complex operations. Therefore, evaluation and improvement of relevant public key system safety can be greatly promoted, and the quick large number decomposition method is widely applicable to the field of information safety and cryptographic technology application.

Description

Technical field [0001] The invention relates to the fields of information security and application of cryptography technology, in particular to a large number fast decomposition method based on application of cryptography technology. Background technique [0002] In modern cryptography, the security of passwords comes first. The complexity of algorithmic solutions to mathematical problems can be described by computational complexity theory, which can provide practical measurement methods for deciphering codes and computational complexity. Therefore, most of today's cryptographic systems often boil down to solving a certain mathematical problem. Some typical mathematical problems in computational complexity theory provide the basis for designing practical and safe high-strength cryptosystems. For example, the public key cryptosystem designed based on the knapsack problem in NPC class, the RSA public key cryptosystem based on the large number factorization problem of NP prob...

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): H04L9/30G06F7/72
Inventor 刘诗章陈豫生贺漫古
Owner 刘诗章
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