China
Africa
Explore chapters and articles related to this topic
Identification and Entity Authentication
Published in Alfred J. Menezes, Paul C. van Oorschot, Scott A. Vanstone, Handbook of Applied Cryptography, 2018
Alfred J. Menezes, Paul C. van Oorschot, Scott A. Vanstone
10.11 Remark (birthday repetitions in random numbers) In generating pseudorandom numbers for use as time-variant parameters, it suffices if the probability of a repeated number is acceptably low and if numbers are not intentionally reused. This may be achieved by selecting the random value from a sufficiently large sample space, taking into account coincidences arising from the birthday paradox. The latter may be addressed by either using a larger sample space, or by using a generation process guaranteed to avoid repetition (e.g., a bijection), such as using the counter or OFB mode of a block cipher (§ 7.2.2).
Combinatorics
Published in Paul L. Goethals, Natalie M. Scala, Daniel T. Bennett, Mathematics in Cyber Research, 2022
This attack rests on the following simple idea: if one generates a number of messages, there is a much larger number of pairs of these messages, any of which may lead to a collision. The name comes from the classical “Birthday Paradox,” which states that if there are 23 people in a room, there is a greater than 50% chance that two of them share a birthday.
A secure authentication and key agreement scheme with dynamic management for vehicular networks
Published in Connection Science, 2023
Yuxiang Zhou, Haowen Tan, Karunarathina Chandrathilaka Appuhamilage Asiria Iroshan
Event1 : In this game, because the communication message in the authentication protocol includes hash function output, can find the collision of messages through . Among, based on the birthday paradox principle (Suzuki et al., 2006), the collision probability of hash function output is at most .