EUVIMEDScopri EUVIMED
Open access · CC BY 4.0

Partial Exposure Attacks Against a Family of RSA-like Cryptosystems

George Teşeleanu

Cryptography · 2024-12-28 · 9 (1) · 2

DOI: 10.3390/cryptography9010002 ↗

At a glance

Journal article in Cryptography, published online on 2024-12-28. Written by George Teşeleanu. Cited 6 times so far (Crossref); 33 references. The full text is freely available (open access, CC BY 4.0).

AbstractDati bibliograficiCiteRelated studies

Abstract (original language)

An RSA generalization using complex integers was introduced by Elkamchouchi, Elshenawy and Shaban in 2002. This scheme was further extended by Cotan and Teșeleanu to Galois fields of order n≥1. In this generalized framework, the key equation is ed−k(pn−1)(qn−1)=1, where p and q are prime numbers. Note that the classical RSA and Elkamchouchi et al.’s key equations are special cases, namely, when n=1 and n=2. In addition to introducing this generic family, Cotan and Teșeleanu described a continued fractions attack capable of recovering the secret key d if d

Cite

APA

Teşeleanu, G. (2024). Partial Exposure Attacks Against a Family of RSA-like Cryptosystems. Cryptography, 9(1), 2. https://doi.org/10.3390/cryptography9010002

Vancouver

Teşeleanu G. Partial Exposure Attacks Against a Family of RSA-like Cryptosystems. Cryptography. 2024;9(1):2. doi:10.3390/cryptography9010002

BibTeX
@article{Teeleanu2024,
  author = {Teşeleanu, George},
  title = {Partial Exposure Attacks Against a Family of RSA-like Cryptosystems},
  journal = {Cryptography},
  year = {2024},
  volume = {9},
  number = {1},
  pages = {2},
  doi = {10.3390/cryptography9010002}
}
Start for free →