Paper 2025/1038 Original: eprint.iacr.org/2025/1038 ↗
Security of Operations on Random Numbers: A Review
Abstract
Random numbers are often used in cryptography algorithms, protocols, and in several security and non-security applications. Such us- ages often apply Arithmetic and Boolean operations on pseudorandom numbers, such as addition, XOR, NOT, bit shifts, and other operations, in order to achieve the desired amount of entropy and desired level of security. In this paper, we have reviewed, studied, and analyzed the se- curity properties of these operations on random numbers: do Arithmetic and Boolean operations and other related operations on cryptograph- ically secure pseudorandom numbers lead to cryptographically secure pseudorandom numbers; do they lead to loss of preservation of entropy?
Metadata
- Available format(s)
PDF- Category
- Applications
- Publication info
- Preprint.
- History
- 2025-06-03: last updated
- 2025-06-03: published
- Short URL
- https://ia.cr/2025/1038
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2025/1038,
author = {Tejas Sharma and Ashish Kundu},
title = {Security of Operations on Random Numbers: A Review},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/1038},
year = {2025},
url = {https://eprint.iacr.org/2025/1038}
}