Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Liqiang Peng"'
Publikováno v:
IEEE Access, Vol 12, Pp 173484-173501 (2024)
The timely and accurate diagnosis of severe faults in the high-speed train air compressor is crucial due to the potential for significant safety issues. In response to this problem, this paper proposes a high-speed train air compressor fault diagnosi
Externí odkaz:
https://doaj.org/article/dd6350e9e7e844ff864ba1a5facbb971
Publikováno v:
Machines, Vol 9, Iss 11, p 285 (2021)
The floating ring bearing (FRB) has been widely used in the field of high-speed rotating machinery such as turbochargers, aviation engines and so on, because of its simple structure, high efficiency and low power consumption. In order to obtain the b
Externí odkaz:
https://doaj.org/article/529f249654db418b92159fdbafc5fe5c
Publikováno v:
Apoptosis. 28:881-891
Dysregulation of autophagy in cancer-associated fibroblasts (CAFs) has been demonstrated to play a role in malignant phenotypes of human tumors. We intended to investigate the function of CAFs autophagy in prostate cancer (PCa). Firstly, CAFs and nor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::66cf633008ab95b33d65f6c479b0d4b5
https://doi.org/10.1007/s10495-023-01828-2
https://doi.org/10.1007/s10495-023-01828-2
Publikováno v:
Multimedia Systems. 29:499-510
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a22d32a9b8f60134c10fbcbf47f630e
https://doi.org/10.1007/s00530-022-00967-x
https://doi.org/10.1007/s00530-022-00967-x
Autor:
Atsushi Takayasu, Liqiang Peng
Publikováno v:
Theoretical Computer Science. 795:432-458
There have been several works for studying the security of CRT-RSA with small CRT exponents d p and d q by using lattice-based Coppersmith's method. Thus far, two attack scenarios have been mainly studied: (1) d q is small with unbalanced prime facto
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a704b60c13707af6755777fc1bb94191
https://doi.org/10.1016/j.tcs.2019.07.031
https://doi.org/10.1016/j.tcs.2019.07.031
Publikováno v:
Journal of Cryptology. 32:1337-1382
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c5b05fb4bf0b0f1d6987d78d75c17a0
https://doi.org/10.1007/s00145-018-9282-3
https://doi.org/10.1007/s00145-018-9282-3
Publikováno v:
Designs, Codes and Cryptography. 86:1997-2033
In this paper we revisit the modular inversion hidden number problem (MIHNP) and the inversive congruential generator (ICG) and consider how to attack them more efficiently. We consider systems of modular polynomial equations of the form $$a_{ij}+b_{
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f242552b47d6c84cf6aa86584b4fdfeb
https://doi.org/10.1007/s10623-017-0435-4
https://doi.org/10.1007/s10623-017-0435-4
Publikováno v:
Journal of Mathematical Cryptology, Vol 11, Iss 2, Pp 117-130 (2017)
In this paper we study an RSA variant with moduli of the form N = p r q l {N=p^{r}q^{l}} ( r > l ≥ 2 {r>l\geq 2} ). This variant was mentioned by Boneh, Durfee and Howgrave-Graham [2]. Later Lim, Kim, Yie and Lee [11] showed that this variant i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2dada413c1d701ff85e5061cda74e3c
https://doi.org/10.1515/jmc-2016-0025
https://doi.org/10.1515/jmc-2016-0025
Publikováno v:
Lecture Notes in Electrical Engineering ISBN: 9789811371226
The problem of factoring RSA moduli with the implicit hint was firstly proposed by May and Ritzenhofen at PKC’09 where unknown prime factors of several RSA moduli shared some number of least significant bits (LSBs), and was later considered by Faug
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a419174a063bc84cdfc25868c901fb4
https://doi.org/10.1007/978-981-13-7123-3_34
https://doi.org/10.1007/978-981-13-7123-3_34
Publikováno v:
Designs, Codes and Cryptography. 83:1-21
In 2007, Sun et al. (IEEE Trans Inf Theory 53(8):2922---2933, 2007) presented new variants of RSA, called Dual RSA, whose key generation algorithm outputs two distinct RSA moduli having the same public and private exponents, with an advantage of redu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e170d4ae7e79804e9d0c9a9bcb80fe0
https://doi.org/10.1007/s10623-016-0196-5
https://doi.org/10.1007/s10623-016-0196-5