Search results

{{Short description|Class of cryptographic attacks}} ...t ''e'' is small or when partial knowledge of a prime factor of the secret key is available. ...

{{Short description|Cryptographic attack on the RSA system}} ...ntinued fraction|continued fraction representation]] to expose the private key ''d'' when ''d'' is small. ...

...of a [[Public-key cryptography|key pair]] to be recovered from the public key in keys generated by devices with the vulnerability. "ROCA" is an acronym f ..._infineon_chips/ |title=Never mind the WPA2 drama... Details emerge of TPM key cockup that hits tonnes of devices |publisher=The Register |access-date=201 ...

...Ernst M. | last2= Gabidulin | title= Proceedings. International Symposium on Information Theory, 2005. ISIT 2005 | chapter= The new construction of rank There are several proposals for public-key cryptosystems based on rank codes. However, most of them have been proven insecure (see e.g. Journ ...

...bility]], then with non-negligible probability, if the adversary is re-run on new inputs but with the same [[random tape]], its second output will also h ...dings of the 13th [[Association for Computing Machinery]] (ACM) Conference on Computer and Communications Security (CCS), [[Alexandria, Virginia]], 2006, ...

...]] in 1991.<ref>Rafail Ostrovsky, Moti Yung: How to Withstand Mobile Virus Attacks (Extended Abstract). PODC 1991: 51-59 [http://dl.acm.org/citation.cfm?doid= ..., the un-compromised (honest) ([[Shamir's Secret Sharing|Shamir-style]]) [[Key distribution|shares]] should be updated in a way that they generate the sam ...

...a generalization of cyclic lattices as ideal lattices. They can be used in cryptosystems to decrease by a square root the number of parameters necessary to describe ...n=978-3-642-13189-9 |editor-last=Gilbert|editor-first=Henri }}</ref> These cryptosystems are provably secure under the assumption that the [[shortest vector problem ...

{{Short description|Security vulnerability in Diffie–Hellman key exchange}} ...status=live }}</ref> The discoverers were able to demonstrate their attack on 512-bit ([[export of cryptography from the United States|US export-grade]]) ...

...irst= Thomas|author2-last= Decru |chapter=An efficient key recovery attack on SIDH |chapter-url=https://eprint.iacr.org/2022/975.pdf | title=Advances in ...tography]] because the security of [[RSA (cryptosystem)|RSA]] is dependent on the infeasibility of factoring integers, the [[integer factorization proble ...