scholarly journals The new integer factorization algorithm based on Fermat’s Factorization Algorithm and Euler’s theorem

2020 ◽  
Vol 10 (2) ◽  
pp. 1469
Author(s):  
Kritsanapong Somsuk
Keyword(s):  
High Performance ◽  
Computation Time ◽  
The Other ◽  
Square Root ◽  
Integer Factorization ◽  
Factorization Algorithm ◽  
Euler’S Theorem ◽  
Prime Factors ◽  
Factorization Algorithms ◽  
Root Operation

Although, Integer Factorization is one of the hard problems to break RSA, many factoring techniques are still developed. Fermat’s Factorization Algorithm (FFA) which has very high performance when prime factors are close to each other is a type of integer factorization algorithms. In fact, there are two ways to implement FFA. The first is called FFA-1, it is a process to find the integer from square root computing. Because this operation takes high computation cost, it consumes high computation time to find the result. The other method is called FFA-2 which is the different technique to find prime factors. Although the computation loops are quite large, there is no square root computing that included into the computation. In this paper, the new efficient factorization algorithm is introduced. Euler’s theorem is chosen to apply with FFA to find the addition result between two prime factors. The advantage of the proposed method is that almost of square root operations are left out from the computation while loops are not increased, they are equal to the first method. Therefore, if the proposed method is compared with the FFA-1, it implies that the computation time is decreased, because there is no the square root operation and the loops are same. On the other hand, the loops of the proposed method are less than the second method. Therefore, time is also reduced. Furthermore, the proposed method can be also selected to apply with many methods which are modified from FFA to decrease more cost.

scholarly journals Improving the initial values of VFactor suitable for balanced modulus

2020 ◽  
Vol 10 (6) ◽  
pp. 6446
Author(s):  
Kritsanapong Somsuk
Keyword(s):  
High Performance ◽  
Main Process ◽  
Public Key Cryptosystem ◽  
Integer Factorization ◽  
Traditional Values ◽  
Factorization Algorithm ◽  
Initial Values ◽  
Prime Factors ◽  
The Difference ◽  
Very High

The aim of this study is to estimate the new initial values of VFactor. In general, this algorithm is one of the members in a group of special proposed integer factorization algorithm. It has very high performance whenever the result of the difference between two prime factors of the modulus is a little, it is also called as balanced modulus. In fact, if this situation is occurred, RSA which is a type of public key cryptosystem will be broken easily. In addition, the main process of VFactor is to increase and decrease two odd integers in order to compute the multiplication until the targets are found. However, the initial values are far from the targets especially that the large value of the difference between two prime factors that is not suitable for VFactor. Therefore, the new initial values which are closer to the targets than the traditional values are proposed to decrease loops of the computation. In experimental results, it is shown that the loops can be decreased about 26% for the example of 256 bits-length of modulus that is from the small result of the difference between prime factors.

MFFV3: An Improved Integer Factorization Algorithm to Increase Computation Speed

2014 ◽  
Vol 931-932 ◽  
pp. 1432-1436 ◽  
Author(s):  
Kritsanapong Somsuk ◽  
Sumonta Kasemvilas
Keyword(s):  
Computation Time ◽  
Experimental Results ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Square Root ◽  
Integer Factorization ◽  
Significant Digit ◽  
Factorization Algorithm ◽  
The Difference ◽  
Computation Speed

RSA, a public key cryptosystem, was proposed to protect the information in the insecure channel. The security of RSA relies on the difficulty of factoring the modulus which is the product of two large primes. We proposed Modified Fermat Factorization Version 2 (MFFV2) modified from Modified Fermat Factorization (MFF) to break RSA. The key of MFFV2 is to decrease the number of times of MFF for computing an integers square root. However, MFFV2 is still time-consuming to some extent due to computation time of the subtraction of two integers for all iterations. Thus, this paper aims to propose Modified Fermat Factorization Version 3 (MFFV3) to increase the computation speed when compared with MFFV2. For MFFV3, we can ignore computing the difference between two integers when we know that the subtractions result is certainly not a perfect square. Hence, we develop the Differences Least Significant Digit Table (DLSDT), the information table used to analyze the least significant digit of the subtractions result. Experimental results show that the computation time of MFFV3 for factoring the modulus is substantially reduced in comparison to MFF and MFFV2 respectively.

scholarly journals On Factoring The RSA Modulus Using Tabu Search

2017 ◽  
Vol 1 (1) ◽  
pp. 30-37
Author(s):  
Ade Candra ◽  
Mohammad Andri Budiman ◽  
Dian Rachmawati
Keyword(s):  
Tabu Search ◽  
Large Integer ◽  
Factorization Problem ◽  
Factorization Algorithm ◽  
Prime Factors ◽  
Hard Problems ◽  
Quadratic Sieve ◽  
Factorization Algorithms ◽  
Python Programming ◽  
Exact Factorization

It is intuitively clear that the security of RSA cryptosystem depends on the hardness of factoring a very large integer into its two prime factors. Numerous studies about integer factorization in the field of number theory have been carried out, and as a result, lots of exact factorization algorithms, such as Fermat’s factorization algorithm, quadratic sieve method, and Pollard’s rho algorithm have been found. The factorization problem is in the class of NP (non-deterministic polynomial time). Tabu search is a metaheuristic in the field of artificial intelligence which is often used to solve NP and NP-hard problems; the result of this method is expected to be close-to-optimal (suboptimal). This study aims to factorize the RSA modulus into its two prime factors using tabu search by conducting experiments in Python programming language and to compare its time performance with an exact factorization algorithm, i.e. Pollard’s algorithm. The primality test is done with Lehmann’s algorithm.

scholarly journals Fault Coverage-Aware Metrics for Evaluating the Reliability Factor of Solar Tracking Systems

Energies ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 1074
Author(s):  
Raul Rotar ◽  
Sorin Liviu Jurj ◽  
Flavius Opritoiu ◽  
Mircea Vladutiu
Keyword(s):  
High Performance ◽  
Computation Time ◽  
Fault Coverage ◽  
Programming Environment ◽  
Tracking Systems ◽  
Circuit Testing ◽  
Reliability Factor ◽  
Solar Tracking ◽  
Mathcad Software ◽  
Python Programming

This paper presents a mathematical approach for determining the reliability of solar tracking systems based on three fault coverage-aware metrics which use system error data from hardware, software as well as in-circuit testing (ICT) techniques, to calculate a solar test factor (STF). Using Euler’s named constant, the solar reliability factor (SRF) is computed to define the robustness and availability of modern, high-performance solar tracking systems. The experimental cases which were run in the Mathcad software suite and the Python programming environment show that the fault coverage-aware metrics greatly change the test and reliability factor curve of solar tracking systems, achieving significantly reduced calculation steps and computation time.

scholarly journals Biofoam of Spittlebug, Poophilus costalis (Walker): Preferential Sites, Temperature Regulation, Chemical Composition and Antimicrobial Activity

Insects ◽  
2021 ◽  
Vol 12 (4) ◽  
pp. 340
Author(s):  
Kitherian Sahayaraj ◽  
Balakrishnan Saranya ◽  
Samy Sayed ◽  
Loko Yêyinou Laura Estelle ◽  
Koilraj Madasamy
Keyword(s):  
Antimicrobial Activity ◽  
Chemical Composition ◽  
High Performance ◽  
Host Plants ◽  
Ground Level ◽  
College Campus ◽  
The Other ◽  
Mimosa Pudica ◽  
Ft Ir ◽  
Gas Chromatography Mass Spectroscopy

The foam produced by nymphs of Poophilus costalis on eleven different host plants belonging to eight families on St. Xavier’s College campus in India was studied over five months. The chemical composition and antimicrobial activity of these biofoams were investigated. The results revealed that P. costalis preferred Theporsia purpurea and Mimosa pudica for laying their eggs and producing foam, over the other tested plants. P. costalis produce their foam on either nodes or internodes on monocotyledons (30%) (p < 0.05), whereas on dicotyledons, they produce more foam on the stems (63.8%) than on the leaves (6.2%) (p < 0.01). The number of nymphs in each piece of foam from P. costalis varied from 1 to 3 (mean = 1.8 per plant). They produced their foam (5.7 to 45.2 cm) from the ground level on a plant. The length and breadth of a piece of foam ranged from 1.0 to 3.9 cm and 0.6 to 4.7 cm, respectively. The foam tended to be cooler than the environment. Qualitative profiling showed that the foam consists of carbohydrates, including maltose; trypsin; amino acids; protease. The foam was also analyzed using a spectrophotometer, Fourier transform infrared spectroscopy (FT-IR), gas chromatography–mass spectroscopy (GC-MS), and high-performance liquid chromatography (HPLC). The antimicrobial activity of the biofoam was the greatest against Staphylococcus aureus, the growth of which was reduced by 55.9 ± 3.9%, suggesting that the foam could be used as an antimicrobial product. However, no activities were observed against Fusarium oxysporum and Candida albicans.

Individual Differences in Attention and the Prediction of Flight Criteria

1971 ◽  
Vol 33 (3_suppl) ◽  
pp. 1335-1342 ◽  
Author(s):  
Daniel Gopher ◽  
Daniel Kahneman
Keyword(s):  
Individual Differences ◽  
Selective Attention ◽  
Dichotic Listening ◽  
High Performance ◽  
The Other ◽  
Listening Test ◽  
Transient Instability ◽  
High Performance Aircraft

A dichotic listening test was constructed which requires S to monitor a relevant message and to ignore a concurrent message presented to the other ear. The test has promising validity for predicting different criteria of proficiency in flying high-performance aircraft. An analysis of the most valid type of errors suggests that a change in an existing orientation is accompanied by a transient instability of selective attention. Most errors in continuous attention are omissions, which indicate a failure of the listening set. Intrusions, which indicate a failure of selectivity, are rare and their frequency is not correlated to flight criteria.

On the Chemistry of Tetrabenzyl Thiuram Disulfide and Tetramethyl Thiuram Disulfide with Bis (Triethoxysilylpropyl) Tetrasulfide in Silica Compounds

2003 ◽  
Vol 76 (4) ◽  
pp. 876-891 ◽  
Author(s):  
R. N. Datta ◽  
A. G. Talma ◽  
S. Datta ◽  
P. G. J. Nieuwenhuis ◽  
W. J. Nijenhuis ◽  
...  
Keyword(s):  
High Performance ◽  
Room Temperature ◽  
Succinic Anhydride ◽  
Dynamic Properties ◽  
The Other ◽  
Resonance Spectroscopy ◽  
Reaction Products ◽  
Negative Effect ◽  
Higher Temperature ◽  
Analytical Tools

Abstract The use of thiurams such as Tetramethyl thiuram disulfide (TMTD) or Tetrabenzyl thiuram disulfide (TBzTD) has been explored to achieve higher cure efficiency. The studies suggest that a clear difference exists between the effect of TMTD versus TBzTD. TMTD reacts with Bis (triethoxysilylpropyl) tetrasulfide (TESPT) and this reaction can take place even at room temperature. On the other hand, the reaction of TBzTD with TESPT is slow and takes place only at higher temperature. High Performance Liquid Chromatography (HPLC) with mass (MS) detection, Nuclear Magnetic Resonance Spectroscopy (NMR) and other analytical tools have been used to understand the differences between the reaction of TMTD and TESPT versus TBzTD and TESPT. The reaction products originating from these reactions are also identified. These studies indicate that unlike TMTD, TBzTD improves the cure efficiency allowing faster cure without significant effect on processing characteristics as well as dynamic properties. The loading of TESPT is reduced in a typical Green tire compound and the negative effect on viscosity is repaired by addition of anhydrides, such as succinic anhydride, maleic anhydride, etc.

Towards A Multi-FPGA Infrared Simulator

2007 ◽  
Vol 4 (4) ◽  
pp. 343-355 ◽  
Author(s):  
Vinay Sriram ◽  
David Kearney
Keyword(s):  
Homeland Security ◽  
Reconfigurable Computing ◽  
High Speed ◽  
High Performance ◽  
Large Scale ◽  
Computation Time ◽  
Ccd Camera ◽  
Hardware Acceleration ◽  
Limiting Factor ◽  
Scene Simulation

High speed infrared (IR) scene simulation is used extensively in defense and homeland security to test sensitivity of IR cameras and accuracy of IR threat detection and tracking algorithms used commonly in IR missile approach warning systems (MAWS). A typical MAWS requires an input scene rate of over 100 scenes/second. Infrared scene simulations typically take 32 minutes to simulate a single IR scene that accounts for effects of atmospheric turbulence, refraction, optical blurring and charge-coupled device (CCD) camera electronic noise on a Pentium 4 (2.8GHz) dual core processor [7]. Thus, in IR scene simulation, the processing power of modern computers is a limiting factor. In this paper we report our research to accelerate IR scene simulation using high performance reconfigurable computing. We constructed a multi Field Programmable Gate Array (FPGA) hardware acceleration platform and accelerated a key computationally intensive IR algorithm over the hardware acceleration platform. We were successful in reducing the computation time of IR scene simulation by over 36%. This research acts as a unique case study for accelerating large scale defense simulations using a high performance multi-FPGA reconfigurable computer.

Sign in / Sign up

Export Citation Format

Share Document