{"id":183509,"date":"2026-09-29T16:54:35","date_gmt":"2026-09-29T14:54:35","guid":{"rendered":"https:\/\/prohoster.info\/blog\/news\/metod-ataki-znachitelno-sokrashhayushhij-resursy-dlya-poddelki-czifrovyh-podpisej-rsa"},"modified":"2026-09-29T16:54:41","modified_gmt":"2026-09-29T14:54:41","slug":"attack-method-that-significantly-reduces-the-resources-needed-to-forge-rsa-digital-signatures","status":"publish","type":"post","link":"https:\/\/prohoster.info\/sq\/blog\/news\/attack-method-that-significantly-reduces-the-resources-needed-to-forge-rsa-digital-signatures","title":{"rendered":"Metoda e sulmit q\u00eb redukton ndjesh\u00ebm burimet p\u00ebr falsifikimin e n\u00ebnshkrimeve digjitale RSA","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"
Hulumtuesit nga Universiteti i Kalifornis\u00eb n\u00eb San Diego kan\u00eb zhvilluar nj\u00eb teknik\u00eb t\u00eb avancuar sulmi ndaj algoritmit RSA, q\u00eb lejon falsifikimin e n\u00ebnshkrimeve digjitale pa faktorizimin e numrave primar\u00eb q\u00eb mb\u00ebshtesin RSA dhe pa nevoj\u00ebn p\u00ebr t\u00eb rikuperuar \u00e7el\u00ebsin e fsheht\u00eb. Burimet e nevojshme p\u00ebr t\u00eb kryer sulmin ndaj nj\u00eb \u00e7el\u00ebsi RSA 1024-bit, jan\u00eb vler\u00ebsuar n\u00eb 1380 vjet llogaritjesh n\u00eb nj\u00eb b\u00ebrtham\u00eb procesori t\u00eb vetme, gj\u00eb q\u00eb n\u00eb klasterin e universitetit lejoi p\u00ebrcaktimin e parametrave t\u00eb nevojsh\u00ebm p\u00ebr formimin e n\u00ebnshkrimeve RSA falsifikues gjat\u00eb 5 muajve (n\u00eb eksperiment nuk u p\u00ebrdor\u00ebn p\u00ebrshpejtues AI dhe GPU, dhe me p\u00ebrdorimin e tyre, koha e llogaritjes mund t\u00eb reduktohet ndjesh\u00ebm). P\u00ebr krahasim, metoda klasike e faktorizationit k\u00ebrkon nga 500,000 deri n\u00eb nj\u00eb milion vjet llogaritjesh n\u00eb nj\u00eb b\u00ebrtham\u00eb procesori p\u00ebr t\u00eb rikostituar \u00e7el\u00ebsin e fsheht\u00eb RSA-1024. <\/p>\n
P\u00ebr t\u00eb kryer nj\u00eb sulm, k\u00ebrkohet q\u00eb t\u00eb ket\u00eb mund\u00ebsin\u00eb p\u00ebr t\u00eb d\u00ebrguar p\u00ebrs\u00ebri k\u00ebrkesa p\u00ebr n\u00ebnshkrimin e t\u00eb dh\u00ebnave q\u00eb krijohen nga sulmuesi, p\u00ebr shembull, duke iu drejtuar sh\u00ebrbimit t\u00eb autorizimit ose modulit HSM. P\u00ebr t\u00eb p\u00ebrcaktuar parametrat RSA-1024 mjafton t\u00eb d\u00ebrgoni 232 k\u00ebrkesa t\u00eb tilla, nd\u00ebrsa p\u00ebr sulmin ndaj \u00e7el\u00ebsave RSA-2048, t\u00eb p\u00ebrdorur n\u00eb protokollin Privacy Pass, k\u00ebrkohen 243. Pasi t\u00eb ket\u00eb marr\u00eb nj\u00eb varg t\u00eb dh\u00ebnash t\u00eb n\u00ebnshkruara, fillon nj\u00eb proces i gjat\u00eb llogaritjeje t\u00eb parametrave (p\u00ebr RSA-1024 af\u00ebrsisht 265 operacione), pas p\u00ebrfundimit t\u00eb t\u00eb cilave sulmuesi mund t\u00eb krijoj\u00eb n\u00ebnshkrime false p\u00ebr \u00e7do pjes\u00eb t\u00eb dh\u00ebnash, duke shpenzuar p\u00ebr \u00e7do n\u00ebnshkrim af\u00ebrsisht 180 or\u00eb llogaritjesh n\u00eb nj\u00eb b\u00ebrtham\u00eb. <\/p>\n
Metoda \u00ebsht\u00eb e aplikueshme vet\u00ebm p\u00ebr n\u00ebnshkrimet RSA, n\u00eb t\u00eb cilat nuk p\u00ebrdoret formatimi dhe mbushja shtes\u00eb para enkriptimit (padding). Sulmi \u00ebsht\u00eb i ndjesh\u00ebm ndaj implementimeve t\u00eb n\u00ebnshkrimit t\u00eb verb\u00ebr, p\u00ebrfshir\u00eb ato q\u00eb p\u00ebrdoren n\u00eb protokollin Privacy Pass. Shumica e implementimeve t\u00eb zakonshme t\u00eb RSA, p\u00ebrfshir\u00eb PKCS#1v1.5 dhe RSA-PSS (q\u00eb p\u00ebrdoren n\u00eb TLS dhe SSH), aplikojn\u00eb mbushje shtes\u00eb dhe nuk jan\u00eb t\u00eb ndjeshme ndaj sulmit. <\/p>\n
The RSA encryption is based on the operation of exponentiation modulo a large number. The public key contains the modulus and the exponent. The modulus is formed based on two random prime numbers that are known only to the owner of the private key. The proposed method is based on a study published in 2007 that proved that extracting the root in the exponent specified in the public key from the encrypted message without information about the secret factors is a less resource-intensive operation than factorization of the factors themselves. <\/p>\n
Using a special number field sieve (SNFS) method, researchers have managed to reduce the complexity of compromising RSA-1024 keys to 265 operations, which enables practical attacks on modern clusters. For RSA 2048-bit keys, the attack complexity is estimated at 290, which is theoretically feasible by large corporations or intelligence agencies. For 4096-bit keys, the attack complexity is 2119 operations, which is currently impractical but below the minimum of 2128 recommended by the NSA, the National Institute of Standards and Technology, and the European Union Agency for Cybersecurity. \n Burimi: opennet.ru<\/a> <\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"