ScholarLens Back to search
2018•Unpublished venueOpen access

Cryptography and factorization methods in cryptography

Subramanyam Durbha

Open full text 0 citations

Abstract

The Security of the RSA cryptosystem depends on the difficulty of finding the prime factors of large integers. Here we explore some of the factorization techniques currently available in cryptography. After giving an overview of cryptography we discuss some of the factorization techniques like Fermat’s factoring, Pollards p-1 method and continued fraction method. We then explore the theory of binary quadratic forms and its applications to factorization.

About this research paper

What this paper is about

The Security of the RSA cryptosystem depends on the difficulty of finding the prime factors of large integers. Here we explore some of the factorization techniques currently available in cryptography. After giving an overview of cryptography we discuss some of the factorization techniques like Fermat’s factoring, Pollards p-1 method and continued fraction method. We then explore the theory of binary quadratic forms and its applications to factorization.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The Security of the RSA cryptosystem depends on the difficulty of finding the prime factors of large integers. Here we explore some of the factorization techniques currently available in cryptography. After giving an overview of cryptography we discuss some of the factorization techniques like Fermat’s factoring, Pollards p-1 method and continued fraction method. We then explore the theory of binary quadratic forms and its applications to factorization.

Key concepts: Cryptography, Computer science, Financial cryptography, ID-based cryptography, Neural cryptography, Theoretical computer science, Computer security, Public-key cryptography

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Cryptography and factorization methods in cryptography — Research Paper | ScholarLens