Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 4 - Lattice-Based Integer Factorisation: An Introduction to Coppersmith’s Method

  • from Part I - Cryptanalysis
  • Edited by Joppe Bos, Martijn Stam
  • Book:
    Computational Cryptography
    Published online:
    11 November 2021
    Print publication:
    02 December 2021, pp 78-105

  • Summary

    In Chapter 4, Lattice-Based Integer Factorisation: An Introduction to Coppersmith’s Method, Alexander May investigates the use of LLL to factor integers as pioneered by Coppersmith. Conceptually, Coppersmith’s method can be deceptively simple: given additional information about an integer to factor (e.g., the knowledge that an RSA key pair (N; e) has a small corresponding private exponent d), derive a system of equations with a small root that reveals the factorization and use LLL to find the small root. As a result, it becomes possible to explore exponentially sized search spaces, while preserving polynomial time by using the famous LLL lattice reduction algorithm. Yet, exploiting Coppersmith’s method in a cryptographic context optimally often involves a number of clever choices related to which system of equations to consider. At first, this is a tantalisingly annoying problem where the choice may appear obvious only in retrospect. May uses his extensive experience in improving the state of the art to explain the reasoning behind various applications in Chapter 4.