Publication

Generating RSA moduli with a predetermined portion

Arjen Lenstra
1998
Conference paper

Abstract

This paper reviews and generalizes a method to generate RSA moduli with a predetermined portion. The potential advantages of the resulting methods are discussed. Both the storage and the computational requirements of the RSA cryptosystem can be considerably reduced. The constructions are as efficient as generation of regular RSA moduli, and the resulting moduli do not seem to offer less security than regular RSA moduli

Official source

https://infoscience.epfl.ch/record/149484?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Generating RSA moduli with a predetermined portion

Graph Chatbot

Chat with Graph Search

Computational conceptual design — typological exploration of spatial truss systems through optimization

Boosting dendritic cell nanovaccines

Swiss Potential for Hydropower Generation and Storage - Synthesis report

Computational conceptual design — typological exploration of spatial truss systems through optimization

Boosting dendritic cell nanovaccines

Swiss Potential for Hydropower Generation and Storage - Synthesis report