Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
RSA security
Description:
An ambiguous term referring either to RSA public-key cryptography or to RSA Security, a cybersecurity company and product brand.
Primary topic:
Cryptography and Residue Arithmetic (46%)
Related topics:
Cryptography and Residue Arithmetic (46%),
Cryptography and Data Security (15%)
OpenAlex ID:
keywords/rsa-security
Threshold cryptosystems
1993
·
Yvo Desmedt
·
Lecture notes in computer science
·
173
Factorization of a 512-Bit RSA Modulus
2000
·
Stefania Cavallar
, Bruce Dodson
, et al.
·
Lecture notes in computer science
·
152
PDF
Modified RSA Encryption Algorithm (MREA)
2012
·
Ravi Shankar Dhakar
, Amit Kumar Gupta
, et al.
·
90
Advances in Cryptology: Proceedings Of Crypto 82
2012
·
David Chaum
, Ronald L. Rivest
, et al.
·
60
The strength of replacement in weak arithmetic
2006
·
Stephen Cook
, Neil Thapen
·
ACM Transactions on Computational Logic
·
48
Efficient, perfect polynomial random number generators
1991
·
S. Micali
, C. P. Schnorr
·
Journal of Cryptology
·
47
PDF
On the security of multi-prime RSA
2008
·
M. Jason Hinek
·
Journal of Mathematical Cryptology
·
44
Analysis of Bernstein’s Factorization Circuit
2002
·
Arjen K. Lenstra
, Adi Shamir
, et al.
·
Lecture notes in computer science
·
36
PDF
Parallel GNFS algorithm integrated with parallel block Wiedemann algorithm for RSA security in cloud computing
2016
·
Laurence T. Yang
, Gaoyuan Huang
, et al.
·
Information Sciences
·
35
An Introduction to the General Number Field Sieve
1998
·
Matthew Edward Briggs
·
VTechWorks (Virginia Tech)
·
35
Group theory in cryptography
2011
·
Simon R. Blackburn
, Carlos Cid
, et al.
·
Cambridge University Press eBooks
·
14
PDF
CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
2007
·
Tetsuya Izu
, Jun Kogure
, et al.
·
Lecture notes in computer science
·
13
Generating RSA moduli with a predetermined portion
1998
·
Lenstra, Arjen K.
·
Infoscience (Ecole Polytechnique Fédérale de Lausanne)
·
13
Analysis of an Enhanced Dual RSA Algorithm Using Pell’s Equation to Hide Public Key Exponent and a Fake Modulus to Avoid Factorization Attack
2020
·
K. R. Raghunandan
, Rovita Robert Dsouza
, et al.
·
Advances in intelligent systems and computing
·
11
Fermat Factorization using a Multi-Core System
2020
·
Hazem M. Bahig
, Hatem M.
, et al.
·
International Journal of Advanced Computer Science and Applications
·
11
PDF
An Efficient RSA Cryptosystem with BM-PRIME Method
2012
·
Sushma Pradhan
, Birendra Kumar Sharma
·
International Journal of Information and Network Security (IJINS)
·
11
Implications of the arithmetic ratio of prime numbers for RSA security
2023
·
Andrey Ivanov
, Nikolai Stoianov
·
International Journal of Applied Mathematics and Computer Science
·
8
Generalized cryptanalysis of small CRT-exponent RSA
2019
·
Liqiang Peng
, Atsushi Takayasu
·
Theoretical Computer Science
·
8
Twin RSA
2005
·
Arjen K. Lenstra
, Benjamin M. M. de Weger
·
Lecture notes in computer science
·
7
PDF
The strength of replacement in weak arithmetic
2004
·
Stephen Cook
, Neil Thapen
·
7
Revisiting the Polynomial-Time Equivalence of Computing the CRT-RSA Secret Key and Factoring
2022
·
Mengce Zheng
·
Mathematics
·
6
PDF
Quantum Computational Number Theory
2012
·
Song Y. Yan
·
Wiley eBooks
·
5
An analogue solution to the problem of factorization
2007
·
Ed Blakey
·
Oxford University Research Archive (ORA) (University of Oxford)
·
5
PDF
A Parallel GNFS Algorithm Based on a Reliable Look-Ahead Block Lanczos Method for Integer Factorization
2006
·
Laurence T. Yang
, Li Xu
, et al.
·
Lecture notes in computer science
·
5
The strength of replacement in weak arithmetic
2004
·
S. Cook
, N. Thapen
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
5
Show more works
View as search
Works count:
173
Citation count:
917
Year
Topic
Type