Format-preserving-encryption as pseudo random number generator in practice.
Saved in:
| Title: | Format-preserving-encryption as pseudo random number generator in practice. |
|---|---|
| Authors: | Mlinarić, Hrvoje1 (AUTHOR) hrvoje.mlinaric@fer.hr, Sruk, Vlado1 (AUTHOR), Hofman, Daniel1 (AUTHOR) |
| Source: | Automatika: Journal for Control, Measurement, Electronics, Computing & Communications. Dec2025, Vol. 66 Issue 4, p999-1008. 10p. |
| Subjects: | Random numbers, Random number generators, Computer performance, Statistical hypothesis testing, Data encryption, Cryptography |
| Abstract: | During many years of work in the industry, we have often encountered the problem of generating a large quantity of unique pseudo-random numbers. In this paper, we describe the challenges of generating a large quantity of unique pseudo-random numbers and propose a new approach to address this issue. Our proposed method uses Format Preserving Encryption (FPE) algorithms, which solve the problem of pre-generating a large number of numbers and verifying whether a newly generated number has already been generated. Ultimately, we found that generating such numbers using FPE algorithms is faster than using system functions to generate pseudo-random numbers. However, this is not the most crucial advantage of this proposal. In the standard approach, the time required to generate new numbers increases exponentially as the pool of generated numbers grows. Our proposed approach using FPE algorithms solves this problem. In this work, we performed a quality check of our pseudo-random number generator using the Diehard Statistical Test Suite, demonstrating that all tests passed without issues. [ABSTRACT FROM AUTHOR] |
| Copyright of Automatika: Journal for Control, Measurement, Electronics, Computing & Communications is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | During many years of work in the industry, we have often encountered the problem of generating a large quantity of unique pseudo-random numbers. In this paper, we describe the challenges of generating a large quantity of unique pseudo-random numbers and propose a new approach to address this issue. Our proposed method uses Format Preserving Encryption (FPE) algorithms, which solve the problem of pre-generating a large number of numbers and verifying whether a newly generated number has already been generated. Ultimately, we found that generating such numbers using FPE algorithms is faster than using system functions to generate pseudo-random numbers. However, this is not the most crucial advantage of this proposal. In the standard approach, the time required to generate new numbers increases exponentially as the pool of generated numbers grows. Our proposed approach using FPE algorithms solves this problem. In this work, we performed a quality check of our pseudo-random number generator using the Diehard Statistical Test Suite, demonstrating that all tests passed without issues. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 00051144 |
| DOI: | 10.1080/00051144.2025.2587409 |
