Factorization in Cryptography: Historical Perspective, Applications, and Cons

This article explores the historical perspective, applications, and cons of factorization in cryptography. It discusses how factorization is used in cryptography to secure public-key encryption schemes and how it can be misused by individuals with destructive objectives. The article also provides a brief overview of the history of factorization and its applications in cryptography.

Running head: FACTORIZATION 1
Factorization
Student’s Name
Institution

FACTORIZATION 2
Cryptography is a significant structuring block of electronic business schemes. Precisely,
cryptography tends utilization for guaranteeing the discretion, genuineness, and truthfulness of
data in an association. According to (Barker 2017, p67), in order to guard the sensitive
information in an organization, encryption should be applied in concealing raw information so
that the encoded data is utterly worthless excluding to the sanctioned persons having the accurate
decryption key, to reserve the legitimacy and truthfulness of information, the numeral autograph
is accomplished on the information in a manner that other individuals cannot imitate the right
signer nor adjust the engaged data without detection. Current lopsided basic cryptography
utilizes scientific procedures that are relatively cool to enhance in one way, but particularly stiff
to improve the contrary application of the same concept. The typical example applied in the case
is a prime factorization concept. Huge primes have at least single practical submission, and they
tend to be used in the construction of cryptosystems (public key) that also are recognized as
irregular cryptosystems and exposed cryptosystems (encryption key). Dual simple kinds of
public-key structures appeared in 1970s; Diffie-Hellman (DH) for crucial contract procedure
anticipated in the year 1975 that depend on the rigidity of Discrete Logarithm Problem (DLP).
After two years at MIT, Rivest, Shamir, and Alderman in America projected the critical
conveyance and digital autograph structures referred by their abbreviations as RSA that grosses
it safety as of the stiffness of the Integer Factorization Problem (IFP). Provided with dual large
prime records p and q, it is an upfront duty to product them and has the multiplied result, n = (p •
q). Though, provided with a bulky complex integer that is a multiplication of double huge prime
aspects, it is tremendously hard to get the two summits figures (Brisson 2017, p34).
2

FACTORIZATION 3
Factorization concept was at one time predominantly of educational interest. It added in solid
reputation afterward the outline of the RSA cryptosystem. It is among the greatest popular
crucial crypto-algorithm that extensively applied the current in software hardware to protect
automated data conveyance on the network particularly the e-business to enhance protection of
delicate data such as figures in credit cards.
Historical perspective
According to (Murphy 2017, p98) in the year 1970, it was hardly probable to feature/factor a
twenty-figure number. Asymmetric cryptography in the year 1980 had developed and was
starting to grasp the extensive application in real submissions. Huge numerals factoring abruptly
converted to vital work. The superlative system of that period was Morrison-Brillhart continued
portion algorithm, built mainly on Maurice Kraitchik’s exertion through 1920’s spell which
upgraded Fermat’s technique of difference-of-squares (Chin, Zhuang, Juan, & Lin, 2015). Their
technique was usually enhanced in the factorization of seventy-numeral figures, with no
documentation of some factorizations nearby a hundred numerals was made. Later, after
examining the intricacy of the continual fraction algorithms, Richard Schroeppel revealed the
essentials in improving their effectiveness, and he started linear sieve operations. Carl
Pomerance applied about of the same concepts in developing the quadratic sieve that still is the
supreme competent overall factoring method for huge digits.
As per the year 1990, with the quadratic sieve algorithm application of factoring, the top score
factored lengthy figure was one hundred and sixteen digits. The major halt for the quadratic sieve
and possibly factoring in common, was the primer of a numerous polynomial variation, initially
by Jim Davis and then Peter Montgomery. This permitted for upfront parallelization, trailed by a
circulated Robert Silverman sort. Arjen Lenstra and Mark Manasse transferred the delinquent to
3

FACTORIZATION 4
the Internet, wherein the year 1994, the RSA (129-digit) number contest tend factorization
utilizing the sluggish time on over 1600 processors (Domanov & De Lathauwer 2016, p56). It
had been predictable in the year 1976, to be in safety for forty quadrillion years. Pollard’s
number field sieve substituted the quadratic sieve in the year 1996. Number Field Sieve (NFS) is
presently at the leading edge of exploration hooked on numeral algorithm proficient in factoring
huge compound digits over one-hundred numerals. The existing top score in factoring a usually
stiff integers is that of the two hundred fraction ciphers contest digit from RSA data Safety, Inc.,
RSA-200 that tends accomplishment through General Number Field Sieve (GNFS). Amongst the
Cunningham numerals, the highest notion is the factorization of two hundred and forty-eight
decimal digit integer by Special Number Field Sieve (SNFS)
Consequently, the standard notion is the “n” magnitude would be selected in a manner that the
period and price for executing the factorization tops the worth of the secured/encrypted data
(Meletiou, Triantafyllou & Vrahatis 2015, p37). But even then, extreme overhaul must quiet
enhanced in the general crypto-scheme, as present expansion in numeral factorization has
increased much quicker than foreknown and it is a hazardous issue for crypto-engineers to
endeavor upon measurable predictions in this ground.
Furthermore, an individual ought to comprehend that it at all times vestiges likely that a fresh
computational technique could be designed from the unsuspicious section that brands factoring
stress-free fortuitously or inappropriately liable on which zone one is on, and no one recognizes
how to construct one yet. According to (Ginot 2015, p430) however, in cryptography, it tends to
warn that factoring large figures is a difficult task but not as previous. This has severe
repercussions for the efficiency of cryptography (public-key) that depend on the exertion of
factoring huge bases for the aforementioned safety. Currently, the intelligent crypto-designer is
4

FACTORIZATION 5
more convenient when selecting critical spans for a public-key structure where he/she tends
considering the envisioned safety, the basis's anticipated lifespan and the present extent of the
factoring art. This rapid, historical perspective demonstrates that the aptitude to factor massive
numerals was not exclusively the consequence of developments in information technology, but
in its place was profoundly grounded on the evolution of arithmetical systems.
Cons of factorization in cryptography
Since governments do not demand specific units in and out of their states, it has to have access to
methods to receive and convey hidden data,that may be a risk to national welfares. Cryptography
has been an issue to numerous restrictions in many nations, extending from limitations of the
practise and spread of software to the public broadcasting of mathematical notions that could be
applied in developing cryptosystems. Though, the Internet has permitted the spread of important
programs and, more prominently, the fundamental techniques of cryptography, so that currently
many of the most progressive cryptosystems and concepts are now in the public dominion
(Goswami, Singh & Bhuyan 2017, p87).
A matter that arises in the application of prime factorization to cryptography is the possible
abuse by individuals with destructive objectives. Often, cryptography can be enhanced by
criminals to hide the data they are transferring back and forward through the use of the internet.
These offenders range from sexual marauders who are trying to obscure any data that ought to
get them in misfortune, drug dealers, bombers or individuals that are committing criminalities
and are trying to cover it from the prying tastes of law enforcement. This misuse of cryptography
conveys up the current anxiety about the government wanting the bases to all encryption
software. This means that are likely to have the ability to intercept somebody's data, decrypt it
and perceive the message. This is a violation of our confidentiality. The present workaround is to
5

FACTORIZATION 6
use readily available encryption software or use software from overseas since those
establishments do not have to be concerned about following particular administration regulations
which are readily available online (Sah et al. 2017).
Factorization applications in cryptography
It is known that factorization is a converse procedure of multiplication concept in mathematics. It
is the performance of excruciating an integer into established lesser digits (factors) that when
reproduced, it composed of a custom actual digit.So it is a stiff procedure to discover the aspects
of huge numbers, yet, it has not established that factoring obligation is hard, and there results in a
way that a quick and cool factoring technique might be uncovered (Ortiz et al. 2018).
The secluded key is time attached, and it is scientifically associated to the matching public key.
Henceforth, it is repeatedly possible to spasm a crucial public scheme by initiating the key
(private) starting the key (public). For incidence, definite Public vital cryptosystems are reflected
in a matter that is stemming from that reserved key from the unrestricted key comprises the
invader to feature a huge number. Consequently, it is computationally unpractical to apply the
descent. This is mainly the noteworthy notion of the public-key cryptosystem (RSA) (Murillo-
Escobar et al. 2015). A determining factoring scheme grounded on arithmetic thoughts of
extensive multiplication was executed in limiting the potential p and q value. As per the
projected algorithm is successive, so it necessitates more stages to find diverse amalgamations of
p and q; is convenient for a lesser quantity of storing. The alternate process to pause RSA built
on Fermat Factorization technique was executed, and it is reachable and straightforward. Even
though, it functions optimally when factor in nearby immediacy the square root of N is available.
A fresh upfront factorization algorithm ground on the Trial Division technique was executed. It
6

FACTORIZATION 7
applies unpleasantly natural mathematical processes but takes more spell in checking all
conceivable odd numbers contiguous to the square root of N (Kim & Jeong 2015, p808).
Factorization is applied in sending of vital information from one entity to another where it
requires super-secret. Government agencies and a military base are among the objects applying
factorization concept in conveying their data. In cryptography, data is transmitted in a form that
only understood by the sender and the receiver of that meaningful information hence the concept
of factorization is greatly enhanced. A simple message is factorized in a manner that only
understood by the sender where he/she provides a unique key to the receiver for decrypting the
information. This means that even an intruder in the system will never at any time get the
concept or information conveyed in the message (Nemec et al. 2017). The notion of factorization
that enhances difficult steps in decrypting the messages makes it vital in its application in
cryptography is it believed that unauthorized access to the system could not disclose the
information in conveyance (Levy & Goldberg 2014, p2183). The concept that makes illegal
entity not able to understand the message enhances its applications since no individual will ever
convey a useless message or steal the useless word from the network. Cryptography improves
excellent secrets in message conveyance as information transferred between the entities is
believed to be only important to the sender and receiver. Some intruders will access data in the
system and use it for malicious gain hence it is most advisable to encrypt data by use of
factorization concept which is difficult to decrypt the information available in the chain.
The fact of number theory enhances cryptography, and primes comprise entirely integer
numbers, so one deals with primes a lot in number model. More precisely, some significant
cryptographic algorithms such as RSA censoriously depend on the detail that the prime
factorization of huge numbers earns a long time (Peikert 2016, p424). Mostly one has a "public
7

FACTORIZATION 8
key" containing a two huge primes multiplication utilized in message encryption and a "secret
key" comprising of the primes utilized in message decryption. One can enhance the public
critical communal, and everybody can utilize it in encryption of messages to oneself, but only
he/she recognize the prime factors and can decrypt the information. Any other individual is
requiring to access the intended encrypted messages he/she have to factor the numeral that
requires a wide range of time to be applicable.
According to (Siahaan 2017, p45) factorization is a frequently used mathematical difficult often
applied in securing public-key encryption schemes. A typical exercise is using very large semi-
primes as the numerals safeguarding the data encryption concept. To pause it, they need have to
get the prime factorization of the enormous semi-prime number which is two or more prime
numbers which are multiplied together hence resulting in the original number. Initially, after a
while of elementary math evaluation, a prime number is any numeral that is only consistently
divisible by numeral 1 and itself. There is an endless number of prime numbers (that is figures do
not at any time get to a zone where they are always divisible to some degree). Moreover, all
numbers have precisely one prime factorization, that is to say, every numeral can be stretched by
multiplying some prime numbers together (Huang, Sidiropoulos & Swami 2014, p215).
Computationally arguing, it is relatively fresh to generate an impartially sizeable prime number.
One goes justly high up in figures and then check in reverse if the number is divisible by
anything. So we can produce our two prime numbers jointly. Then multiply them together, and
that’s simple enough. As a quick example, using more cool in understanding primes. Multiplying
two numbers is a precisely an easy problem, and it gauges well when getting into the more
significant numbers. However, factoring figures is a computationally hard problem (Cheng et al.
2017). It’s cool for smaller numbers, but once twitch in dealing with huge numbers, it can yield
8

FACTORIZATION 9
computers, days to months or years, and even centuries to resolve the problem and get the actual
number. There is no relaxed shortcut for factoring figures whereas it is a trial and error
progression. One would have to effort all of the primes that are in a lesser amount than the
particular number until he/she finds which prime numbers that its product results to that
particular number. This only permits for more minor figures, but once commence dealing with
huge numbers the number of likely numbers needed in checking against the other becomes so
huge that even modern computers are not capably enhancing it in a reasonable time edge.
It's presently believed that factoring semiprimes is stiff (open difficult) and also that breaking
RSA is about as rigid as factoring n (open problem, the RSA problem), at least arithmetically. Of
course non-mathematically there are masses of other gears one can enhance, and this is known as
Rubber-hose cryptanalysis. Anyway, that is how factoring difficulty is associated with
encryption and cryptography in whole. RSA encryption method is the most extensively utilized
asymmetric encryption technique in the world as of its capability to provide in height level of
encryption with no recognized algorithm prevailing yet to be able to resolve it. Based on some
bright breakthroughs in cryptography and arithmetic including the Diffie-Hellman Key Exchange
and trapdoor function, encryption (RSA) has turned to be a paramount aspect in securing various
communication transversely around the world (Chen et al. 2016).
Future of factorization in cryptography
In theory, an innovative technology could condense the existing cryptographic systems (such as
RSA) uselessly. Existing cryptographic use the procedure of prime factorization to choice a
number so huge that it would be unbearable for anyone to break the ciphertext. With today’s
computing influence, it would take masses of years before a computer could decrypt the text (Liu
et al. 2016).
9

FACTORIZATION 10
The following significant threat to existing cryptography structures is the quantum computer that
is currently under research by several universities around the globe. A sizeable significant
computer, if one is perpetually built, could supposedly factor numbers speedily enough to
overthrow the code, which would enhance this cryptographic and its prime factorization
impractical.
If a substantial computer is ultimately built, the prime factorization procedures under usage in
encryption would be extracted as being useless. Though, there will be alternative cryptographic
structures that employ several algorithms which do not consider the prime factorization concept.
It appears that the imminent of prime factorization and its submission to cryptography may be
approaching termination due to the dispensation capabilities of quantum computing. If a standard
computer would take billions of years to interpret an encrypted text, a dramatic computer could
tentatively decipher that text in a few minutes (Cao & Bai 2015, p47).
A trapdoor function is a precise vital concept in cryptography where it is minor to go from one
form to another state, but to work out in the reverse direction by going back to the original state
becomes infeasible without excellent info, referred to as the “trapdoor.”
According to (Brown 2016, p222) the best-recognized trapdoor function now, that is the base for
RSA cryptography, tend recognition as the concept of Prime Factorization. Principally, prime
factorization (also known as Numeral Factorization) is the idea in number theory that comprises
integers can be disintegrated into smaller integers. All compound numbers (non-prime numbers)
that are fragmented down to their best primary are poised of prime numbers. This procedure is
identified as prime factorization and has profound implications when smeared in cryptography
function. Fundamentally, prime factorization of enormously large prime numbers that converts
infeasible to compute owing to the sheer quantity of trial and error obligated to factor the number
10

FACTORIZATION 11
to its greatest essential constituents efficaciously. Currently, no efficient factorization algorithm
exists to accomplish that concept.
11

FACTORIZATION 12
References
Barker, E. (2017). SP 800-67 Rev. 2, Recommendation for Triple Data Encryption Algorithm
(TDEA) Block Cipher. NIST special publication, 800, 67.
Brisson, A. (2017, August). Rapid factorization of composite primes: An alternative to the sieve
method. In 2017 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced &
Trusted Computed, Scalable Computing & Communications, Cloud & Big Data
Computing, Internet of People and Smart City Innovation
(SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI). IEEE.
Brown, D. R. (2016). Breaking RSA may be as difficult as factoring. Journal of Cryptology,
29(1), 220-241.
Cao, Y., & Bai, J. (2015, October). A passive attack against an asymmetric key Exchange
Protocol. In Computer Science and Mechanical Automation (CSMA), 2015 International
Conference on (pp. 45-48). IEEE.
Chen, L., Chen, L., Jordan, S., Liu, Y. K., Moody, D., Peralta, R., ... & Smith-Tone, D. (2016).
Report on post-quantum cryptography. US Department of Commerce, National Institute
of Standards and Technology.
Cheng, C., Lu, R., Petzoldt, A., & Takagi, T. (2017). Securing the Internet of Things in a
quantum world. IEEE Communications Magazine, 55(2), 116-120.
Chin, W. S., Zhuang, Y., Juan, Y. C., & Lin, C. J. (2015). A fast parallel stochastic gradient
method for matrix factorization in shared memory systems. ACM Transactions on
Intelligent Systems and Technology (TIST), 6(1), 2.
12

FACTORIZATION 13
Domanov, I., & De Lathauwer, L. (2016). Generic uniqueness of a structured matrix
factorization and applications in blind source separation. IEEE Journal of Selected Topics in
Signal Processing, 10(4), 701-711.
Ginot, G. (2015). Notes on factorization algebras, factorization homology and applications. In
Mathematical aspects of quantum field theories (pp. 429-552). Springer, Cham.
Goswami, P., Singh, M. M., & Bhuyan, B. (2017). A new public key scheme based on integer
factorization and discrete logarithm. Palestine Journal of Mathematics, 6(2).
Huang, K., Sidiropoulos, N. D., & Swami, A. (2014). Non-negative matrix factorization
revisited: Uniqueness and algorithm for symmetric decomposition. IEEE Transactions on Signal
Processing, 62(1), 211-224.
Kim, K. S., & Jeong, I. R. (2015). A new certificateless signature scheme under enhanced
security models. Security and Communication Networks, 8(5), 801-810.
Levy, O., & Goldberg, Y. (2014). Neural word embedding as implicit matrix factorization. In
Advances in neural information processing systems (pp. 2177-2185).
Liu, J., Fan, A., Jia, J., Zhang, H., Wang, H., & Mao, S. (2016). Cryptanalysis of Public Key
Cryptosystems Based on Non-Abelian Factorization ProblemsCryptanalysis of Public Key
Cryptosystems Based on Non-Abelian Factorization Problems. Tsinghua Science and
Technology, 21(03), 104-111.
Meletiou, G. C., Triantafyllou, D. S., & Vrahatis, M. N. (2015). Handling problems in
cryptography with matrix factorization. Journal of Applied Mathematics and Bioinformatics,
5(3), 37.
13

FACTORIZATION 14
Murillo-Escobar, M. A., Cruz-Hernández, C., Abundiz-Pérez, F., López-Gutiérrez, R. M., & Del
Campo, O. A. (2015). A RGB image encryption algorithm based on total plain image
characteristics and chaos. Signal Processing, 109, 119-131.
Murphy, J. (2017). Factorization and Collision Algorithms in Algebraic Cryptography (Doctoral
dissertation, Wesleyan University).
Murphy, J. H. (2017). Factorization and Collision Algorithms in Cryptography.
Nemec, M., Sys, M., Svenda, P., Klinec, D., & Matyas, V. (2017, October). The Return of
Coppersmith's Attack: Practical Factorization of Widely Used RSA Moduli. In Proceedings of
the 2017 ACM SIGSAC Conference on Computer and Communications Security (pp. 1631-
1648). ACM.
Ortiz, J. N., Araujo, R. R., Costa, S. I., Dahab, R., & Aranha, D. F. (2018). On Lattices for
Cryptography.
Peikert, C. (2016). A decade of lattice cryptography. Foundations and Trends® in Theoretical
Computer Science, 10(4), 283-424.
Sah, C. P., Jha, K., & Nepal, S. (2016, March). Zero-knowledge proofs technique using integer
factorization for analyzing robustness in cryptography. In Computing for Sustainable Global
Development (INDIACom), 2016 3rd International Conference on (pp. 638-642). IEEE.
Siahaan, A. P. U. (2017). Factorization Hack of RSA Secret Numbers.
14