Results 211 to 220 of about 39,031 (252)

RSA

2010
Au travers des récits de Régis, Sylvie et Annabelle, cette bande dessinée met en lumière la réalité sociale de la pauvreté et de l'exclusion sociale en France et en particulier sur le territoire lorientais. (4e de couv.)
Stan Floresco, Robert Kessler, Ronald L. Cowan, Robert Kessler, Ronald L. Cowan, Mark Slifstein, Andrea Cipriani, John Geddes, Tooru M. Mizuno, Seithikurippu R. Pandi-Perumal, Milton Kramer, Michael J. Thorpy, Shelby Freedman Harris, D. Warren Spence, Harriet de Wit, Galen R. Wenger, David V. Sheehan, Kathy H. Sheehan, Peter Riederer, Siegfried Hoyer, Klaus A. Miczek, Christoph Hiemke, Luis Stinus, Stéphanie Caillé, Martine Cador, Susan Jones, Josee E. Leysen, Xavier Langlois, Lieve Heylen, Adriaan A. Lammertsma, Hilde Lavreysen, John Atack, Arthur Christopoulos, Gregory D. Stewart, Patrick M. Sexton, Iván Izquierdo, Lia R. Bevilaqua, Martin Cammarota, Lukas Pezawas, Francis C. Colpaert, Mischa de Rover, Sander Nieuwenhuis, Sarah H. Heil, Stacey C. Sigmon, Stephen T. Higgins, Roy Wise, Paul B. S. Clarke, Mary E. Cain, Michael T. Bardo, Sunila G. Nair, Yavin Shaham, Yavin Shaham, John R. Mantsch, Alan J. Budney, David S. Baldwin, Ashwini Padhi, Naomi A. Fineberg, Helen J. Cassaday, Michael M. Morgan, MacDonald J. Christie, Seithikurippu R. Pandi-Perumal, Milton Kramer, Michael J. Thorpy, Shelby Freedman Harris, D. Warren Spence, Stephen M. Stahl, Meghan M. Grady, Stephen M. Stahl, Warren H. Meck, Catalin V. Buhusi, Thomas Steckler, Ennio Esposito, Roberto William Invernizzi, Matthew I. Palmatier, Rick A. Bevins, Francis C. Colpaert, Francis C. Colpaert, Craig A. Erickson, David J. Posey, Kelly Blankenship, Kimberly A. Stigler, Christopher J. McDougle, Mark Slifstein, Giovanni Hernandez, Peter Shizgal, Michael J. Kuhar, Tomek J. Banasikowski, Richard J. Beninger, Sara Tomlinson, Glen B. Baker, Stephen C. Fowler, Peter J. Flor, Inga D. Neumann, Joseph H. Friedman, Britta Hahn, Bernard Le Foll, Grasielle C. Kincheski, Leandro J. Bertoglio, Antonio Pádua Carobrez, Suzanne H. Mitchell, Harriet de Wit, Marie-Louise G. Wadenberg, Marlene Dobkin de Rios, Charles S. Grob, Theodora Duka, Linda Lundström, Silvia Gatti McArthur, Will Spooren, Peter J. Flor, Inga D. Neumann, Trevor W. Robbins, Jos Prickaerts, Harriet de Wit, Harriet de Wit, Peter H. Boeijinga, Yavin Shaham, Sunila G. Nair   +116 more
  +5 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
Soren Toksvig-Larsen, Edward Valstar, L Ryd   +2 more
exaly   +3 more sources

Post-quantum RSA

2017
This paper proposes RSA parameters for which (1) key generation, encryption, decryption, signing, and verification are feasible on today’s computers while (2) all known attacks are infeasible, even assuming highly scalable quantum computers. As part of the performance analysis, this paper introduces a new algorithm to generate a batch of primes.
Bernstein, Daniel J., Heninger, Nadia, Lou, Paul, Valenta, Luke   +3 more
openaire   +2 more sources

RSA in Spine: A Review [PDF]

Global Spine Journal, 2017
Study Design: Systematic review of literature. Objectives: This systematic review was conducted to investigate the accuracy of radiostereometric analysis (RSA), its assessment of spinal motion and disorders, and to investigate the ...
Humadi, Ali, Dawood, Sulaf, Halldin, Klas, Freeman, Brian   +3 more
exaly   +3 more sources

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   +1 more source

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   +1 more source

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

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