ScholarLens Back to search
2009•Unpublished venueRequires access

The Berlekamp algorithm

John Kerl

Open publisher page 0 citations

Abstract

Integer factorization is a Hard Problem. Some cryptosystems, such as RSA, are in fact designed around the difficulty of integer factorization. For polynomials with coefficients in the finite field Fq, on the other hand, we can use the Berlekamp algorithm to factor polynomials of high degree in reasonable amounts of time. In this project, you will see how the algorithm works, prove its correctness, and analyze its computational complexity. This project is aimed toward those with interests in computational algebra, finite

About this research paper

What this paper is about

Integer factorization is a Hard Problem. Some cryptosystems, such as RSA, are in fact designed around the difficulty of integer factorization. For polynomials with coefficients in the finite field Fq, on the other hand, we can use the Berlekamp algorithm to factor polynomials of high degree in reasonable amounts of time. In this project, you will see how the algorithm works, prove its correctness, and analyze its computational complexity. This project is aimed toward those with interests in computational algebra, finite

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

Integer factorization is a Hard Problem. Some cryptosystems, such as RSA, are in fact designed around the difficulty of integer factorization. For polynomials with coefficients in the finite field Fq, on the other hand, we can use the Berlekamp algorithm to factor polynomials of high degree in reasonable amounts of time. In this project, you will see how the algorithm works, prove its correctness, and analyze its computational complexity. This project is aimed toward those with interests in computational algebra, finite

Key concepts: Correctness, Integer factorization, Integer (computer science), Factorization, Mathematics, Algebra over a field, Factorization of polynomials, Finite field

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The Berlekamp algorithm — Research Paper | ScholarLens