A method of cracking cryptographic algorithms through matches in hash functions. It is based on the birthday paradox, according to which the probability of two people sharing a birthday is far higher than it seems — for a group of 23 people, for example, the probability is 50%. Similarly, the probability of detecting a collision among target hash functions is much higher than might be expected, enabling an attacker to find matching fragments using fewer iterations.
-
Celebrities’ photos leak: why should businesses care?
-
Mirage Kitten targeting aviation and FinTech sectors across the Middle East and Africa with a new malware set
-
APT group HoneyMyte upgrades CoolClient: the backdoor gets a kernel-level Windows rootkit
-
Armored Likho expands its cyber-espionage toolkit
-
Head Mare APT is exploiting vulnerabilities in an unpatched TrueConf server to deliver PhantomCore and PhantomGraph to video conference participants
-
OctLurk and SilkLurk: newly identified tailored backdoors in cyber-espionage campaign in Central Asia