Small CRT-Exponent RSA Revisited (Q5738972)

From MaRDI portal

Revision as of 22:45, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 6729781

Language	Label	Description	Also known as
English	Small CRT-Exponent RSA Revisited	scientific article; zbMATH DE number 6729781

Statements

scholarly article

0 references

Small CRT-Exponent RSA Revisited (English)

0 references

Atsushi Takayasu

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

13 June 2017

0 references

zbMATH Keywords

CRT-RSA

0 references

cryptanalysis

0 references

Coppersmith's method

0 references

lattices

0 references

LLL algorithm

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-56614-6_5

0 references

Inferring Sequences Produced by Nonlinear Pseudorandom Number Generators Using Coppersmith’s Methods

0 references

Public Key Cryptography - PKC 2006

0 references

Advances in Cryptology - CRYPTO 2003

0 references

Cryptanalysis of RSA with private key d less than N/sup 0.292/

0 references

The Magma algebra system. I: The user language

0 references

Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known

0 references

Finding a Small Root of a Univariate Modular Equation

0 references

Small solutions to polynomial equations, and low exponent RSA vulnerabilities

0 references

0 references

Advances in Cryptology - EUROCRYPT 2004

0 references

0 references

A New Partial Key Exposure Attack on Multi-power RSA

0 references

Information Security and Privacy

0 references

Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?

0 references

Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA

0 references

0 references

Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization

0 references

Partial Key Exposure Attacks on Takagi’s Variant of RSA

0 references

A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants

0 references

A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073

0 references

On Optimal Bounds of Small Inverse Problems and Approximate GCD Problems with Higher Degree

0 references

A Unified Framework for Small Secret Exponent Attack on RSA

0 references

Factoring polynomials with rational coefficients

0 references

Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits

0 references

New Partial Key Exposure Attacks on CRT-RSA with Large Public Exponents

0 references

Solving Linear Equations Modulo Unknown Divisors: Revisited

0 references

0 references

Using LLL-Reduction for Solving RSA and Factorization Problems

0 references

0 references

Cryptanalysis of Variants of RSA with Multiple Small Secret Exponents

0 references

Small secret exponent attack on RSA variant with modulus \(N=p^rq\)

0 references

Revisiting prime power RSA

0 references

Better Lattice Constructions for Solving Multivariate Linear Equations Modulo Unknown Divisors

0 references

Cryptanalysis of RSA with Multiple Small Secret Exponents

0 references

General Bounds for Small Inverse Problems and Its Applications to Multi-Prime RSA

0 references

Partial Key Exposure Attacks on RSA: Achieving the Boneh-Durfee Bound

0 references

Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents

0 references

How to Generalize RSA Cryptanalyses

0 references

Partial key exposure attacks on CRT-RSA: general improvement for the exposed least significant bits

0 references

Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs

0 references

A Tool Kit for Partial Key Exposure Attacks on RSA

0 references

Cryptanalysis of short RSA secret exponents

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-56614-6_5

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5738972

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5738972&oldid=36327109"