Wiener attack and weak keys of the RSA cryptosystem

Abstract It is proved that the generalized Wiener attack on the RSA cryptosystem allows one to find not only small, but also some large secret exponents d , and the fraction of exponents d which are weak against this attack is heuristically estimated as O ( N −1/2 ).

Authors

Publication Details

Journal
Discrete Mathematics and Applications
Published
2025-10-01
DOI
https://doi.org/10.1515/dma-2025-0027
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Wiener attack and weak keys of the RSA cryptosystem

Andrey E. Trishin
Discrete Mathematics and Applications
Cryptography and Data Security
article

Wiener attack and weak keys of the RSA cryptosystem

Andrey E. Trishin
article en

Abstract

Abstract It is proved that the generalized Wiener attack on the RSA cryptosystem allows one to find not only small, but also some large secret exponents d , and the fraction of exponents d which are weak against this attack is heuristically estimated as O ( N −1/2 ).

Discrete Mathematics and ApplicationsVol. 35(5)
Openalex Percentile: Top 16%
Cryptography and Data Security
DOISourceOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Wiener attack and weak keys of the RSA cryptosystem — Andrey E. Trishin · Discrete Mathematics and Applications (2025) | TGRS Research Map | TGRS