Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Public exponent"'
Autor:
Emmanuel Fouotsa, Abderrahmane Nitaj
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography
Journal of Discrete Mathematical Sciences and Cryptography, non, 2019, ⟨10.1080/09720529.2019.1587827⟩
Journal of Discrete Mathematical Sciences and Cryptography, non, 2019, ⟨10.1080/09720529.2019.1587827⟩
International audience; Let N = pq be an RSA modulus and e be a public exponent. Numerous attacks on RSA exploit the arithmetical properties of the key equation ed − k(p − 1)(q − 1) = 1. In this paper, we study the more general equation eu −
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b2b2eefece5d22bb8e0f48a69cce8dad
https://doi.org/10.1080/09720529.2019.1587827
https://doi.org/10.1080/09720529.2019.1587827
Publikováno v:
Information Security Conference (ISC 2021)
Information Security Conference (ISC 2021), Nov 2021, Bali, Indonesia
Lecture Notes in Computer Science ISBN: 9783030913557
Information Security Conference (ISC 2021), Nov 2021, Bali, Indonesia
Lecture Notes in Computer Science ISBN: 9783030913557
International audience; We consider four variants of the RSA cryptosystem with an RSA modulus N = pq where the public exponent e and the private exponent d satisfy an equation of the form ed − k (p^2 − 1)( q^2 − 1 )= 1. We show that, if the pri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2cb7dbd9272730690c49e333bc5a9011
https://hal.archives-ouvertes.fr/hal-03437901
https://hal.archives-ouvertes.fr/hal-03437901
Autor:
Barać, Marko
Kriptosustavi s javnim ključem su važni u kriptografiji jer je ključ za šifriranje javno dostupan, to jest nema potrebe za prethodnom razmjenom tajnih ključeva. Prvi i najpopularniji kriptosustav s javnim ključem je RSA kriptosustav čija je si
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c6cefbe0a19f9423e605af02f7d59df0
https://repozitorij.svkst.unist.hr/islandora/object/pmfst:1183/datastream/PDF
https://repozitorij.svkst.unist.hr/islandora/object/pmfst:1183/datastream/PDF
Publikováno v:
Computer Standards & Interfaces. 74:103470
RSA is a well known standard algorithm used by modern computers to encrypt and decrypt messages. In some applications, to save the decryption time, it is desirable to have a short secret key d compared to the modulus N. The first significant attack t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5bfa1d3074687ad86b219d193eefc3d5
https://doi.org/10.1016/j.csi.2020.103470
https://doi.org/10.1016/j.csi.2020.103470
Autor:
Xianmeng Meng, Xuexin Zheng
Publikováno v:
Information Processing Letters. 115:858-862
Let N = p q be an RSA modulus with balanced primes p and q. Suppose that the public exponent e and private exponent d satisfy ed - 1 = k ? ( N ) . We revisit the birthday attack against short exponent RSA proposed by Meng and Zheng at ACISP 2012. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::36b0569ff1b2182706c965049514c4a0
https://doi.org/10.1016/j.ipl.2015.06.013
https://doi.org/10.1016/j.ipl.2015.06.013
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Daniel R. L. Brown
Publikováno v:
Journal of Cryptology. 29:220-241
If factoring is hard, this paper shows that straight line programs cannot efficiently solve the low public exponent RSA problem. More precisely, no efficient algorithm can take an RSA public key as input and then output a straight line program that e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11e164fcbb8d786a7272a27fe8cc482e
https://doi.org/10.1007/s00145-014-9192-y
https://doi.org/10.1007/s00145-014-9192-y
Publikováno v:
International Journal of Computer Applications. 49:39-42
Boneh-Durfee extended the bound for low private exponent from 0.25 (provided by wiener) to 0.292 with public exponent size is same as modulus size. They have used powerful lattice reduction algorithm (LLL) with coppersmith's theory of polynomials. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d25b444f2952c3eed670151a006a41db
https://doi.org/10.5120/7880-1190
https://doi.org/10.5120/7880-1190
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :912-918
In some applications, a short private exponent d is chosen to improve the decryption or signing process for RSA public key cryptosystem. However, in a typical RSA, if the private exponent d is selected first, the public exponent e should be of the sa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e5cab536bd11c074084ca184b6b6172
https://doi.org/10.1587/transfun.e92.a.912
https://doi.org/10.1587/transfun.e92.a.912
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :2326-2332
This investigation proposes two methods for embedding backdoors in the RSA modulus N=pq rather than in the public exponent e. This strategy not only permits manufacturers to embed backdoors in an RSA system, but also allows users to choose any desire
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::81531367565bdd0ed1f07e10ad6b3a5a
https://doi.org/10.1587/transfun.e92.a.2326
https://doi.org/10.1587/transfun.e92.a.2326