CN111143758A - Data processing method based on Lelmus Walan conjecture and application - Google Patents
Data processing method based on Lelmus Walan conjecture and application Download PDFInfo
- Publication number
- CN111143758A CN111143758A CN201911399538.3A CN201911399538A CN111143758A CN 111143758 A CN111143758 A CN 111143758A CN 201911399538 A CN201911399538 A CN 201911399538A CN 111143758 A CN111143758 A CN 111143758A
- Authority
- CN
- China
- Prior art keywords
- data processing
- computer
- processing method
- lemonavir
- conjecture
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- General Physics & Mathematics (AREA)
- Pure & Applied Mathematics (AREA)
- Mathematical Optimization (AREA)
- Mathematical Analysis (AREA)
- Computational Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Theoretical Computer Science (AREA)
- Operations Research (AREA)
- Algebra (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention belongs to the technical field of data processing equipment, and discloses a data processing method based on Lemu Warner guess and application thereof.A test result obtained through actual measurement and analysis of two environments of a mobile phone and a computer is converted into a formula of Lemu Warner splitting number and implanted into the mobile phone or the computer to become executable software; and after the software is optimized, the computational power is displayed. The invention combines the number theory model and the computer algorithm, and can be presented by mobile phone or computer software to provide rapid operation after downloading and installation; the method is more convenient for researchers researching the Kingnara guess of Remusera, can quickly find out related prime numbers to greatly increase the data processing speed, shorten the operation time, reduce the cost and enhance the benefit; meanwhile, the invention provides two application terminals capable of analyzing the Lelmonar conjecture and provides a new processing method for estimating the number of p +2q formal expressions of 2n + 1.
Description
Technical Field
The invention belongs to the technical field of data processing equipment, and particularly relates to a data processing method based on a Remulave Walsh conjecture and application thereof.
Background
Currently, the closest prior art: the lemowana hypothesis is one of the unsolved problems in the number theory, stated as: any odd number greater than 5 can be expressed as the sum of a prime number and an even semi-prime number; if represented by an algebraic expression: for each integer n greater than 2, prime p and q can be found to satisfy.
At the present stage, the main reason for studying the lemonana conjecture is that the expansibility of the learners is very strong, including the aspects of internet security, cloud computing, cryptography, big data and the like. With the rapid development of science and technology, information technology represented by computer technology has become an indispensable tool for expanding human intelligence. The lemonana guess plagues mathematicians for many years. The prime number problem is involved and usually operates on a fairly large number. However, computers also have situations where it is not possible to do so or where it is very inconvenient to operate. The lemowana hypothesis was proposed by french mathematician ehler mulawa in 1895, and although there is a research on lemowana in the prior art, there is no correlation technique for applying it to data calculation.
In summary, the problems of the prior art are as follows: although the development of modern science and technology greatly promotes the progress of cryptography, many passwords cannot be cracked, and the main reasons can be classified into two points, namely the limitation of the current mathematical method and the limitation of a computer algorithm. These two points can catch up to the present limited knowledge and understanding of prime numbers. For example, in modern cryptography, the most widely used RSA algorithm is based on a large knowledge of prime numbers, because one of the key equations is N-P-Q, where P and Q are both prime numbers. Because there is no correlation method for applying the lemonana conjecture to the data calculation in the prior art, and there is no correlation data processing system based on the lemonana conjecture, the method becomes a knowledge gap in the development of cryptography and correlation techniques.
The prior art method has slow speed for generating prime numbers, and no effective method exists for judging whether a number is a prime number or not, and practically, an AKS prime number detection method is adopted except for a Miller-Rabin primality test method. Whether a prime number is generated or determined is a challenging task. Given an integer value n at random, it can be estimated that, when 2n +1, there are several conditions (which may also be called groups or pairs) for satisfying p +2q, which is one of the difficulties that the technology needs to overcome.
In addition, many studies are limited to the completeness and requirements of the experimental set-up.
The difficulty of solving the technical problems is as follows: the above-mentioned problem of the operation efficiency of RSA and the related algorithms is limited by the way of processing the prime numbers, so that there is no major breakthrough so far, and the technical problem is difficult. The method mainly comprises the following points that at present, research on Lelmonana conjecture is few, understanding and knowledge of prime numbers are limited, and the threshold for solving the technical problem is very high. Unfortunately, current research cryptography techniques employ techniques that are only skilled in one subject, either mathematics or calculators, and rarely both. The challenge is to increase the difficulty of solving the technical problem, and is also one of the reasons that the data processing method and the terminal based on the lemonana guess are not generated so far.
The significance of solving the technical problems is as follows: the method can quickly calculate the splitting number of the Remulawatt conjecture. The significance of the mathematical aspect is that the old mathematical methods or tools have not been able to satisfy the solution to the lemowana guess. At the computer level, even with more powerful and faster processors, a processor is simply useless if there is no good algorithm to work with it. The problem of exploring the lemonavir guess is not a single mathematical problem or a single calculator problem, and the innovation work of mathematics and a calculator is directly and indirectly led in the process of analyzing the lemonavir guess. The existing known methods or techniques, thinking and the like do not obtain better results in solving the problem of the lemonavir guess; however, the invention has made good results, which is an innovative embodiment and is also a meaning for solving the technical problem. The invention enables researchers to be free from the limitation of time and space and can continuously carry out research work.
Disclosure of Invention
Aiming at the problems in the prior art, the invention provides a data processing method based on the Remulavena conjecture and application thereof. Meanwhile, aiming at one of the technical difficulties in the prior art, the experimental result obtained by actual measurement and analysis of two environments of the mobile phone and the computer is converted into a formula, then the formula is implanted into the mobile phone or the computer to become executable software, the executable software is optimized, and finally the computing power embodied by the mobile phone App is displayed, so that the innovation capability of overcoming the technical problems is embodied.
Aiming at the completeness and requirements of a plurality of research limitations on experimental equipment, the android-based mobile experimental system has the advantages that data processing is enabled to be mobile (Mobility) through the assistance of the android system, researchers are not limited by regions and equipment (Any time, Any person), and research is uninterrupted.
The invention can use the data processing method based on the Lemoovaran guess to quickly find out the related prime numbers so as to greatly increase the speed of data processing, shorten the operation time, reduce the cost and enhance the benefit. The method greatly contributes to the technical breakthrough of mathematics and computers.
The invention is realized in this way, and a data processing method based on the lemonava conjecture comprises the following steps: through actual measurement and analysis of two environments of a mobile phone and a computer, an obtained experimental result is converted into a formula of a Remulawatt split number and is implanted into the mobile phone or the computer to become executable software; and after the software execution method is optimized, the computational power data are displayed.
Specifically, the invention converts the obtained experimental result into a formula through actual measurement and analysis of two environments of the mobile phone and the computer, and the formula is implanted into the mobile phone or the computer to become executable software. The system has high compatibility and expansibility no matter the environment interface of the mobile phone and the computer, can be arranged on a related data or information processing system according to requirements, such as a Goodbach calculator and a Lelward guess calculator, quickly finds out related prime numbers to greatly increase the data processing speed, shorten the operation time, reduce the cost and enhance the benefit. The method greatly contributes to the technical breakthrough of mathematics and computers.
Further, through actual measurement and analysis of two environments of a mobile phone and a computer, the obtained experimental result is as follows:
further, the formula of the lemonarwave split number is:
L(x)=2n+1=p+2q;
wherein x represents the lemownah number, i.e., the sum of 2n + 1; l (x) represents the Remulavener split; n represents a number greater than 2.
Further, the running method of the executable software comprises the following steps:
and splitting the data based on the Leimuhan conjecture to obtain a Leimuhan splitting number of the data, obtaining a Leimuhan splitting number progressive curve equation based on the Leimuhan splitting number and the estimation value, and dynamically adjusting the obtained Leimuhan splitting number approximate equation.
Further, the lemonavir split number asymptotic curve equation is as follows:
in the formula, L' (x) represents an estimated value of the estimated lemonavir fraction.
Another object of the present invention is to provide a calculator for operating the data processing method based on the lemonava conjecture.
Another object of the present invention is to provide a mobile phone App or a computer for operating the data processing method based on lemonana guess.
Another object of the present invention is to provide a data processing system based on lemonana guess, which implements the data processing method based on lemonana guess, and the data processing system based on lemonana guess includes:
an input module: for inputting an integer n;
an interval limiting module: inputting a value interval of an integer n;
the calculation processing module: splitting the integer n based on the lemonaval guess to obtain a corresponding lemonaval split number;
an output module: for outputting the obtained lemonavir split number.
Another objective of the present invention is to provide a mobile phone APP based on the lemonavir guess, which implements the data processing method based on the lemonavir guess, and the mobile phone APP based on the lemonavir guess is used to dynamically adjust the lemonavir split approximation equation.
It is another object of the present invention to provide a computer program product stored on a computer readable medium, comprising a computer readable program for providing a user input interface to implement the data processing method based on lemonavir hypothesis when executed on an electronic device.
Another object of the present invention is to provide a computer-readable storage medium, which includes instructions that, when executed on a computer, cause the computer to perform the data processing method based on lemonavir hypothesis, thereby improving data processing efficiency by quickly finding prime numbers.
In summary, the advantages and positive effects of the invention are: the current problems are that the speed of generating prime numbers is slow in the existing method, an effective method is not available for judging whether a number is a prime number or not, and the technology is also difficult to break through. In practice, the AKS prime number assay is used in addition to the Miller-Rabin prime test. It is challenging to generate a prime number or determine a prime number.
In the scheme provided by the invention, an integer value n is randomly given, the invention can estimate that when 2n +1, a plurality of conditions (also called as a group or a pair) meeting p +2q exist, the obtained experimental result is converted into a formula through actual measurement and analysis of two environments of a mobile phone and a computer, then the formula is implanted into the mobile phone or the computer to become executable software, the executable software is optimized, and finally the computing power embodied by a mobile phone App is displayed, namely the innovation capability of overcoming the technical problems is embodied.
The invention combines the number theory model and the computer algorithm, and can be presented by mobile phone or computer software to provide rapid operation after downloading and installation; is more convenient for researchers researching the guess of the driving turnera and can assist the researchers to further understand the guess of the driving turnera by bringing in alternative parameter values. The advantages of the invention can be classified into Mobility and Ubiquitous (Ubiquitous), and the contribution is that researchers do not limit the time, the region and the equipment and do research uninterruptedly.
The invention has the advantages that the method has the potential of effectively solving the problems of prime number generation speed and slow prime number judging speed, and if the method is applied to a data processing method and a data processing system, the related prime numbers can be quickly found out to greatly increase the data processing speed, shorten the operation time, reduce the cost and enhance the benefit.
The invention provides an estimation formula of the lemonavir split number, and the terminal based on the invention can more intuitively see how many possible combinations the lemonavir split number has; meanwhile, the invention provides two application terminals capable of analyzing the Lelmonar conjecture and provides a new processing method for estimating the number of p +2q formal expressions of 2n + 1. The invention can improve the operation efficiency and achieve the purpose of making contribution to the technical breakthrough of mathematics and computers.
Drawings
Fig. 1 is a schematic structural diagram of a data processing system based on the lemonava conjecture according to an embodiment of the present invention.
In the figure: 1. an input module; 2. an interval limiting module; 3. a calculation processing module; 4. and an output module.
Fig. 2 is a schematic diagram of an App interface according to the lemonava conjecture provided in the embodiment of the present invention.
FIG. 3 is a schematic diagram of an App interface with dynamic adjustment approximation equation provided by an embodiment of the present invention.
Fig. 4 is a schematic diagram of a lemonavir fraction distribution curve provided in an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail with reference to the following embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
In view of the problems in the prior art, the present invention provides a data processing method and terminal based on lemonava conjecture, which are described in detail below with reference to the accompanying drawings.
The data processing method based on the lemonava conjecture provided by the embodiment of the invention comprises the following steps:
the obtained experimental result is converted into a formula through actual measurement and analysis of two environments of the mobile phone and the computer, and the formula is implanted into the mobile phone or the computer to become executable software. The system has high compatibility and expansibility no matter the environment interface of the mobile phone and the computer, can be arranged on a related data or information processing system according to requirements, such as a Goodbach calculator and a Lelward guess calculator, quickly finds out related prime numbers to greatly increase the data processing speed, shorten the operation time, reduce the cost and enhance the benefit. The method greatly contributes to the technical breakthrough of mathematics and computers.
In the embodiment of the invention, the experimental results obtained by the actual measurement and analysis of the two environments of the mobile phone and the computer are as follows:
in an embodiment of the invention, a method for executing software comprises the following steps: and splitting the data based on the Leimuhan conjecture to obtain a Leimuhan splitting number of the data, obtaining a Leimuhan splitting number progressive curve equation based on the Leimuhan splitting number and the estimation value, and dynamically adjusting the obtained Leimuhan splitting number approximate equation.
The method for splitting data based on the lemonavir guess to obtain the lemonavir split number includes:
the method is carried out according to the following formula:
L(x)=2n+1=p+2q;
wherein x represents the lemownah number, i.e., the sum of 2n + 1; l (x) represents the Remulavener split; n represents a number greater than 2.
The lemonavir split number progressive curve equation provided by the embodiment of the invention is as follows:
in the formula, L' (x) represents an estimated value of the estimated lemonavir fraction.
As shown in fig. 1-2, a data processing system based on lemonavir guess according to an embodiment of the present invention includes:
an input module 1: for inputting the integer n.
The interval limiting module 2: and the value interval is used for inputting the integer n.
The calculation processing module 3: and splitting the integer n based on the lemonavir guess to obtain a corresponding lemonavir split number.
The output module 4: for outputting the obtained lemonavir split number.
As shown in fig. 3, the mobile phone APP based on the lemonavir hypothesis according to the embodiment of the present invention is used to dynamically adjust the lemonavir splitting number approximation equation.
The following is a further description of the present invention with reference to the specific principle analysis.
1.1 Lemu Warner conjecture
In the prior art, the theorem of lemowatt number is described, namely:
but is still somewhat complex.
To solve the above problem, the lemonavir hypothesis provided by the present invention is any odd number x greater than 5, which can be expressed as the sum of a prime number and an even semi-prime number. For example, the integer 15 can be expressed as 2 different sets of results, 5+2 · 5 and 11+2 · 2, respectively. I.e., the lemumann conjecture or the duviet conjecture. This formula may be represented by l (x) 2n +1 p +2q (2)
1.2 lux number
Given a positive odd number 281, there are 12 sets that meet the lemonavir guess rule, called lemonavir split 12, see table one. Any odd number is given, the lemonavir split number can be calculated in one step, but the lemonavir split number cannot be directly calculated until now.
TABLE I when n is 140, lemonavir split number
To solve the above problem, the present invention calculates the distribution of the lux fraction when the odd number is 7 to 10000 hmuswarfarin. A special case is when 2n +1 is 2+2 · 2, although both p and q are prime numbers, which contradicts the assumption. The present invention uses values between 7 and 10000 to mod3 and found that when L is greater than 65, the Lmod3 result is 0, which represents a comparable split number. Based on this phenomenon, the present invention estimates three asymptotic curves.
Wherein x represents the lemonavir number, i.e., the sum of 2n + 1; l (x) represents the Remulavener split; l' (x) represents an estimated value of the estimated lemonavir split; n represents a number greater than 2.
TABLE II Lelmonah split and estimate
Based on experimental data, the present invention obtains an asymptote and divides it into three sections, namely the case where mod3 results in 0,1, 2, respectively.
The approximate equation of the lemonavir split number asymptotic curve is as follows:
the present invention is further described below in conjunction with the experimental results.
The experimental result is shown in fig. 2, and the lemonana App is designed and realized based on the development environment of the android. The App has two functions, the left half part is the result of the generated lemonarwave split number, an integer n is input, and the obtained result is output according to a formula (2); and the right half part is a value interval of an integer n, and then all the lemonavir split numbers in the interval are listed.
Fig. 3 is a second App developed based on the android environment for dynamically adjusting the lemonavir split approximation equation.
Fig. 4 is an asymptotic graph of the lemonavir fraction.
For example, if an integer 2560 is input in App of fig. 2, and L is 5121 calculated from 2n +1 ═ p +2q, the number of resulting groups L (x) matching the lemumann guess is 133, and the estimated group number L' (x) is 271; in fig. 4App, 6 parameter values of the equation are respectively input, x and y represent the value range of n, and 100 and 1000 are input, so that the result of the adjustment as shown in the figure can be obtained. Table three and table four discuss the relationship of 0,1 and 2 for the results after n and L respectively mod 3.
xxxxxxxxxxxxxxxxxxxxxxxxxxxx
Vvvvvvvvvvvvvvvxxxxxxxxxxxxxx
xxxxxxxxxxxxxxxxxxxxxxx
bbbbbbbbbbbbbbbbbbbbbbbbbb
bbbbbbbbbbbbbbbbbbbbbbbbbbb
bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb
bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb
Relationship between Mousler-Mohr-Watt-Numbers
TABLE IV. 9 possible relationships
The invention is further described below with reference to specific analyses and demonstrations.
Theorem 1 (Bertrand-Chebyshev theorem)
For any real number n, when n ≧ 1, there is always a prime number between n and 2 n.
And (3) proving that:
suppose that
For each n, when 1 ≦ n <4010, such as 3, 5, 7, 13, 23, 43, 83, 163, 317, 631, 1259, 2503, … …, 3989, 4001, 4003, 4007. A relatively small prime number p is selected, followed by a prime number p' that is larger than n. Their relationship is as follows:
p≤n≤p′≤2p≤2n.
and (5) finishing the demonstration.
And (3) proving that:
from p ═ q, 2n ═ 3 p-1, that is, 2n +1 ═ 3 p; otherwise, contradict the assumption.
And (3) proving that:
2n + 1-p-2 q, i.e. p + 1-2 q, is obtained by assuming n-p; otherwise, contradict the assumption.
And (3) proving that:
since L ≡ 2n +1, it is assumed that if L ≡ 0(mod3), then the case of n ≡ 1(mod3) has no effect. L can be divided into three parts, 3| L, so L is not a prime number; otherwise, contradict the assumption.
And (3) proving that:
there are 9 cases of the proposition, which are (0,0), (0,1), (0,2), (1,0), (1,1), (1,2), (2,0), (2,1), (2,2), respectively.
Case 5. from case 4, it can be seen that in case n ≡ 1(mod3), L is L ≡ 0(mod3), in other words, in case 2, L ≡ 1(mod3), n is L ≡ 0(mod 3); otherwise, contradict the assumption. Thus, (1,1) is absent.
To this end, the following relationship is obtained:
the present invention will be further described with reference to specific effects.
The invention designs and realizes android application based on the Remulawani conjecture. The invention provides an estimation formula of the lemonavir split number, and according to the estimation formula, the possible combinations of the lemonavir split number can be more intuitively seen.
The advantages of the invention are further embodied in that: the contribution of Mobility and Ubiquitous (Ubiquitous) is that researchers do not limit the time, the region and the equipment and do research uninterruptedly. Because of the characteristics of mobility and ubiquitous growth, the field limitation of researchers is undoubtedly reduced, the research is not interrupted, and the efficiency is further improved.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When used in whole or in part, can be implemented in a computer program product that includes one or more computer instructions. When loaded or executed on a computer, cause the flow or functions according to embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, the computer instructions may be transmitted from one website site, computer, server, or data center to another website site, computer, server, or data center via wire (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL), or wireless (e.g., infrared, wireless, microwave, etc.)). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that includes one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid state disk (ssd)), among others.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.
Claims (10)
1. A data processing method based on a Lelmonana guess is characterized by comprising the following steps:
through actual measurement and analysis of two environments of a mobile phone and a computer, an obtained experimental result is converted into a formula of a Remulawatt split number and is implanted into the mobile phone or the computer to become executable software; and after the software execution method is optimized, the computational power data are displayed.
3. the method of claim 1, wherein the lemonavir hypothesis-based data processing method is characterized in that the lemonavir split number is expressed by the following formula:
L(x)=2n+1=p+2q;
wherein x represents the lemownah number, i.e., the sum of 2n + 1; l (x) represents the Remulavener split; n represents a number greater than 2.
4. The data processing method based on lemonava conjecture as claimed in claim 1, wherein the executable software is executed by a method comprising:
and splitting the data based on the Leimuhan conjecture to obtain a Leimuhan splitting number of the data, obtaining a Leimuhan splitting number progressive curve equation based on the Leimuhan splitting number and the estimation value, and dynamically adjusting the obtained Leimuhan splitting number approximate equation.
6. A calculator for operating the data processing method based on the Remulawatt conjecture as claimed in claims 1 to 5.
7. A mobile phone App or a computer for operating the data processing method based on the Remulawatt conjecture as claimed in claims 1 to 5.
8. A data processing system based on the Lemoor's guess for implementing the data processing method based on the Lemoor's guess of any one of claims 1 to 5, wherein the data processing system based on the Lemoor's guess comprises:
an input module: for inputting an integer n;
an interval limiting module: inputting a value interval of an integer n;
the calculation processing module: splitting the integer n based on the lemonaval guess to obtain a corresponding lemonaval split number;
an output module: for outputting the obtained lemonavir split number.
9. A computer program product stored on a computer readable medium, comprising a computer readable program for providing a user input interface for implementing the data processing method according to any one of claims 1 to 5.
10. A computer-readable storage medium comprising instructions which, when executed on a computer, cause the computer to perform the data processing method based on lemonavir hypothesis as recited in any one of claims 1 to 5.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201911399538.3A CN111143758A (en) | 2019-12-30 | 2019-12-30 | Data processing method based on Lelmus Walan conjecture and application |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201911399538.3A CN111143758A (en) | 2019-12-30 | 2019-12-30 | Data processing method based on Lelmus Walan conjecture and application |
Publications (1)
Publication Number | Publication Date |
---|---|
CN111143758A true CN111143758A (en) | 2020-05-12 |
Family
ID=70522030
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201911399538.3A Pending CN111143758A (en) | 2019-12-30 | 2019-12-30 | Data processing method based on Lelmus Walan conjecture and application |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN111143758A (en) |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20100223478A1 (en) * | 2009-02-27 | 2010-09-02 | Certicom Corp. | System and method for performing exponentiation in a cryptographic system |
CN102769528A (en) * | 2012-06-15 | 2012-11-07 | 刘诗章 | Quick large number decomposition method based on cryptographic technology application |
CN104067217A (en) * | 2011-12-15 | 2014-09-24 | 英赛瑟库尔公司 | Method for generating prime numbers proven suitable for chip cards |
CN106487512A (en) * | 2015-08-31 | 2017-03-08 | 北京同方微电子有限公司 | A kind of RSA key is to quick-speed generation system and method |
TWM588288U (en) * | 2019-08-26 | 2019-12-21 | 劉政連 | Goldbach conjecture computing system |
-
2019
- 2019-12-30 CN CN201911399538.3A patent/CN111143758A/en active Pending
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20100223478A1 (en) * | 2009-02-27 | 2010-09-02 | Certicom Corp. | System and method for performing exponentiation in a cryptographic system |
CN104067217A (en) * | 2011-12-15 | 2014-09-24 | 英赛瑟库尔公司 | Method for generating prime numbers proven suitable for chip cards |
CN102769528A (en) * | 2012-06-15 | 2012-11-07 | 刘诗章 | Quick large number decomposition method based on cryptographic technology application |
CN106487512A (en) * | 2015-08-31 | 2017-03-08 | 北京同方微电子有限公司 | A kind of RSA key is to quick-speed generation system and method |
TWM588288U (en) * | 2019-08-26 | 2019-12-21 | 劉政連 | Goldbach conjecture computing system |
Non-Patent Citations (1)
Title |
---|
JUNJIE HUANG 等: "A Study of Android Calculator Based on Lemoine’s Conjecture", 《AIP CONFERENCE PROCEEDINGS》, vol. 1982, no. 1 * |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Gao et al. | Privacy-preserving Naive Bayes classifiers secure against the substitution-then-comparison attack | |
Liu et al. | Efficient and privacy-preserving outsourced calculation of rational numbers | |
Yang et al. | Traveling waves in a nonlocal dispersal SIR model with critical wave speed | |
EP3035587B1 (en) | Hypersphere-based multivariable public key signature/verification system and method | |
Krasnobaev et al. | The method of raising numbers, represented in the system of residual classes to an arbitrary power of a natural number | |
WO2022156159A1 (en) | Method and device for adjusting model parameters, and storage medium and program product | |
US11620105B2 (en) | Hybrid floating point representation for deep learning acceleration | |
WO2023020216A1 (en) | Extremum determination method and apparatus based on secure multi-party computation, device, and storage medium | |
Nair et al. | Analysis of ECC for application specific WSN security | |
Onuki et al. | A constant-time algorithm of CSIDH keeping two points | |
KR20080084499A (en) | Key calculation mehtod and key agreement method using the same | |
CN111143758A (en) | Data processing method based on Lelmus Walan conjecture and application | |
TW201909040A (en) | Neural network processing method, apparatus, device and computer readable storage media | |
CN111047007B (en) | Activation function calculation unit for quantized LSTM | |
Kovtun et al. | Development of a search method of birationally equivalent binary Edwards curves for binary Weierstrass curves from DSTU 4145-2002 | |
Duta et al. | Framework for evaluation and comparison of integer factorization algorithms | |
George et al. | IEEE 754 floating-point addition for neuromorphic architecture | |
Kanayama et al. | Implementation of an elliptic curve scalar multiplication method using division polynomials | |
Zhao et al. | Privacy-preserving outsourcing schemes of modular exponentiations using single untrusted cloud server | |
Cho et al. | HELPSE: Homomorphic encryption-based lightweight password strength estimation in a virtual keyboard system | |
Nasir et al. | Fast trust computation in online social networks | |
Venturini et al. | Performance analysis of parallel modular multiplication algorithms for ECC in mobile devices | |
Sun et al. | A privacy-preserving reinforcement learning approach for dynamic treatment regimes on health data | |
Chang et al. | A division-free algorithm for fixed-point power exponential function in embedded system | |
Nanjo et al. | A performance analysis and evaluation of SIDH with implementation-friendly classes of quadratic extension fields |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination |