Results 211 to 220 of about 40,886 (249)

A New Attack on RSA and CRT-RSA

2012
In RSA, the public modulus N=pq is the product of two primes of the same bit-size, the public exponent e and the private exponent d satisfy $ed\equiv 1 \pmod{(p - 1)(q - 1)}$. In many applications of RSA, d is chosen to be small.
openaire   +2 more sources

Digital automated RSA compared to manually operated RSA

Journal of Biomechanics, 2000
The accuracy of digital Roentgen stereophotogrammetric analysis (RSA) was compared to the accuracy of a manually operated RSA system. For this purpose, we used radiographs of a phantom and radiographs of patients. The radiographs of the patients consisted of double examinations of 12 patients that had a tibial osteotomy and of double examinations of 12
E R, Valstar, H A, Vrooman, S, Toksvig-Larsen, L, Ryd, R G, Nelissen   +4 more
openaire   +2 more sources

Cryptanalysis of Dual RSA

Designs, Codes and Cryptography, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liqiang Peng, Lei Hu 0003, Yao Lu 0002, Jun Xu 0022, Zhangjie Huang   +4 more
openaire   +2 more sources

Generalised Cycling Attacks on RSA and Strong RSA Primes

1999
Given an RSA modulus n, a ciphertext c and the encryption exponent e, one can construct the sequence x0 = c mod n, xi+1 = xie mod n; i = 0, 1,... until gcd(xi+1 - x0, n) ≠ 1 or i or i > B, B a given boundary. If i ≤ B, there are two cases. Case 1: gcd(xi+1 -x0, n) = n. In this case xi = m and the secret message m can be recovered. Case 2: 1 ≠ gcd(xi+1 -
Marc Gysin, Jennifer Seberry
openaire   +1 more source

Tunable Balancing of RSA

2005
We propose a key generation method for RSA moduli which allows the cost of the public operations (encryption/verifying) and the private operations (decryption/signing) to be balanced according to the application requirements. Our method is a generalisation of using small public exponents and small Chinese remainder (CRT) private exponents.
Steven D. Galbraith, Chris Heneghan, James F. McKee   +2 more
openaire   +2 more sources

On the Distribution of the RSA Generator

1999
Let 19, m and e be integers such that gcd(19, m) = 1. Then one can define the sequence (un) by the recurrence relation $${{u}_{n}} \equiv u_{{n - 1}}^{e}\left( {\,\bmod \,m} \right),0{{u}_{n}}m - 1,n = 1,2,..., $$ (1) with theinitial value \({{u}_{0}} = \nu \).
John B. Friedlander, Daniel Lieman, Igor E. Shparlinski   +2 more
openaire   +1 more source

Comparative Analysis Of Rsa And Modified Rsa Cryptography

i-manager's Journal on Computer Science, 2016
In RSA (Rivest-Shamir-Adleman) cryptography, the basic factors are key length, calculation time, security, authentication and integrity. Generally, in public key cryptography, the key length and security is directly proportional to each other. Original RSA uses two prime numbers as input, which gives the modulus 'n'; encryption and decryption process ...
openaire   +1 more source

Implementing the RSA cryptosystem

Computers & Security, 1987
Techniques for a software implementation of the RSA cryptosystem are presented. They allow both space and time requirements of the RSA scheme to be minimized. A hash function to be used in connection with the cryptosystem is presented; this function avoids weaknesses of other hash functions published previously.
openaire   +1 more source

Reptile Search Algorithm (RSA): A Nature-Inspired Meta-Heuristic Optimizer

Expert Systems With Applications, 2022
Zong Woo Geem, Laith Abualigah, Putra Sumari   +2 more
exaly  

???????????????????? ?????????????????? ?????????????????????????????? RSA ???? ?????????????? ???????????????????? ?????????????????????? ?????????????????? ????????????????????????

2020
?????????????????????? ???????????????????????? ?????????????????????????? ?????????????????? ???????????????????? ????????????????????. ?????????????? ???? ???????????????????????? ?? ????????????????????. ?????????????????? ???????????????????????? ?????????????????? ??.8?? ?? ?????????????????????? ?????????????????? ?????? ??????????????????????????
openaire   +1 more source