Author Type

Graduate Student

Date of Award

1999

Document Type

Thesis

Publication Status

Version of Record

Submission Date

October 2026

Thesis/Dissertation Advisor [Chair]

Klingler, Lee

Abstract

RSA cryptosystems with decryption exponent d less than N 0.292, for a given RSA modulus N, show themselves to be vulnerable to an attack which utilizes modular polynomials and the LLL Basis Reduction Algorithm. This result, presented by Dan Boneh and Glenn Durfee in 1999, is an improvement on the bound of N0.25 established by Wiener in 1990. This thesis examines in detail the LLL Basis Reduction Algorithm and the attack on RSA as presented by Boneh and Durfee.

Extent

85 p.

Comments

Thesis (M.S.)--Florida Atlantic University, 1999.|Thesis (M.S.)--Florida Atlantic University, 1999.

Identifier

FADT15730

Format

pdf

Download

Share

COinS