Publication

On the security of Lenstra's variant of DSA without long inversions

Arjen Lenstra
2001
Conference paper

Abstract

We use bounds of exponential sums to show that, for a wide class of parameters, the modification of the digital signature algorithm (DSA) scheme proposed by A.K. Lenstra (see Proc. Asiacrypt'96, Lect. Notes in Comp. Sci., vol.1163, p.57-64, 1996) is as secure as the original scheme

Official source

https://infoscience.epfl.ch/record/149710?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.

On the security of Lenstra's variant of DSA without long inversions

Graph Chatbot

Chat with Graph Search

When Your AI Becomes a Target: AI Security Incidents and Best Practices

Revisiting the Indifferentiability of the Sum of Permutations

PROFACTORY: Improving IoT Security via Formalized Protocol Customization

When Your AI Becomes a Target: AI Security Incidents and Best Practices

Revisiting the Indifferentiability of the Sum of Permutations

PROFACTORY: Improving IoT Security via Formalized Protocol Customization