UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Dual RSA and Its Security Analysis

IEEE transactions on information theory, 2007-08, Vol.53 (8), p.2922-2933

2007

Volltextzugriff (PDF)

Power Analysis by Exploiting Chosen Message and Internal Collisions – Vulnerability of Checking Mechanism for RSA-Decryption

Lecture notes in computer science, 2005, p.183-195

1ère éd, 2005

Volltextzugriff (PDF)

Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs

Cryptographic Hardware and Embedded Systems - CHES 2004, 2004, p.119-132

2004

Volltextzugriff (PDF)

RSA-OAEP is secure under the RSA assumption

Journal of cryptology, 2004-03, Vol.17 (2), p.81-104

2004

Volltextzugriff (PDF)

Systematic Design of RSA Processors Based on High-Radix Montgomery Multipliers

IEEE transactions on very large scale integration (VLSI) systems, 2011-07, Vol.19 (7), p.1136-1146

2011

Volltextzugriff (PDF)

The Power of RSA Inversion Oracles and the Security of Chaum’s RSA-Based Blind Signature Scheme

Financial Cryptography, 2002, p.319-338

2002

Volltextzugriff (PDF)

Efficient generation of shared RSA keys

Lecture notes in computer science, 1997, p.425-439

1997

Volltextzugriff (PDF)

Power Attack on Small RSA Public Exponent

Cryptographic Hardware and Embedded Systems - CHES 2006, 2006, p.339-353

2006

Volltextzugriff (PDF)

Small solutions to polynomial equations, and low exponent RSA vulnerabilities

Journal of cryptology, 1997-09, Vol.10 (4), p.233-260

COPPERSMITH, D

1997

Volltextzugriff (PDF)

How to Strengthen the Security of RSA-OAEP

IEEE transactions on information theory, 2010-11, Vol.56 (11), p.5876-5886

2010

Volltextzugriff (PDF)

Cryptanalysis of RSA with two decryption exponents

Information processing letters, 2010-02, Vol.110 (5), p.178-181

2010

Volltextzugriff (PDF)

Breaking RSA may not be equivalent to factoring

Lecture notes in computer science, 1998, p.59-71

1998

Volltextzugriff (PDF)

Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1

Advances in Cryptology — CRYPTO '98, 1998, p.1-12

1998

Volltextzugriff (PDF)

RSA-Based Secret Handshakes

Coding and Cryptography, 2006, p.252-274

2006

Volltextzugriff (PDF)

Fixed points of the RSA encryption algorithm

Theoretical computer science, 2010, Vol.411 (1), p.288-292

Chmielowiec, Andrzej

2010

Volltextzugriff (PDF)

The RSA Group is Pseudo-Free

Journal of cryptology, 2010-04, Vol.23 (2), p.169-186

Micciancio, Daniele

2010

Volltextzugriff (PDF)

Cryptanalysis of RSA with more than one decryption exponent

Information processing letters, 2010-04, Vol.110 (8), p.336-340

2010

Volltextzugriff (PDF)

Small secret exponent attack on RSA variant with modulus N=prq

Designs, codes and cryptography, 2014, Vol.73 (2), p.383-392

Sarkar, Santanu

2014

Volltextzugriff (PDF)

Another Look at Small RSA Exponents

Lecture notes in computer science, 2006, p.82-98

2006

Volltextzugriff (PDF)

Fault attacks on RSA with CRT: Concrete results and practical countermeasures

Lecture notes in computer science, 2002, p.260-275

2002

Volltextzugriff (PDF)

New Partial Key Exposure Attacks on RSA

Advances in Cryptology - CRYPTO 2003, 2003, p.27-43

2003

Volltextzugriff (PDF)

Batch RSA

Journal of cryptology, 1997, Vol.10 (2), p.75-88

FIAT, A

1997

Volltextzugriff (PDF)

Why One Should Also Secure RSA Public Key Elements

Cryptographic Hardware and Embedded Systems - CHES 2006, 2006, p.324-338

2006

Volltextzugriff (PDF)

A note on the average number of RSA fixed points

Theoretical computer science, 2011-08, Vol.412 (35), p.4729-4737

Lim, Chae Hoon

2011

Volltextzugriff (PDF)

Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered

Fault Diagnosis and Tolerance in Cryptography, 2006, p.13-23

2006

Volltextzugriff (PDF)

1 – 25 von 980

Menü

Weitere Dienste

Einstellungen

Dual RSA and Its Security Analysis

Power Analysis by Exploiting Chosen Message and Internal Collisions – Vulnerability of Checking Mechanism for RSA-Decryption

Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs

RSA-OAEP is secure under the RSA assumption

Systematic Design of RSA Processors Based on High-Radix Montgomery Multipliers

The Power of RSA Inversion Oracles and the Security of Chaum’s RSA-Based Blind Signature Scheme

Efficient generation of shared RSA keys

Power Attack on Small RSA Public Exponent

Small solutions to polynomial equations, and low exponent RSA vulnerabilities

How to Strengthen the Security of RSA-OAEP

Cryptanalysis of RSA with two decryption exponents

Breaking RSA may not be equivalent to factoring

Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1

RSA-Based Secret Handshakes

Fixed points of the RSA encryption algorithm

The RSA Group is Pseudo-Free

Cryptanalysis of RSA with more than one decryption exponent

Small secret exponent attack on RSA variant with modulus N=prq

Another Look at Small RSA Exponents

Fault attacks on RSA with CRT: Concrete results and practical countermeasures

New Partial Key Exposure Attacks on RSA

Batch RSA

Why One Should Also Secure RSA Public Key Elements

A note on the average number of RSA fixed points

Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered

Aktive Filter

Suchergebnisse filtern