A proposal of a faster variant of known provably secure PRBGs
Corbo Antonio Esposito, Didone Fabiola

TL;DR
This paper proposes a modified CSPRBG called SCSPRBG that achieves higher throughput while maintaining security, demonstrated by a practical implementation exceeding 100 Mbits/sec on mobile devices.
Contribution
It introduces the SCSPRBG concept, a new variant of CSPRBG designed for faster cryptographic random bit generation without compromising security.
Findings
Achieved over 100 Mbits/sec throughput on mobile devices.
Defined SCSPRBG as a faster variant of CSPRBG.
Provided a standard methodology for using CSPRBGs in cryptography.
Abstract
We make a new proposal about how to use in an effective way a CSPRBG (Computationally Secure Pseudo Random Bit Generator) for cryptographic purposes. We introduce the definitions of TCSPRBG (Typical CSPRBG) and SCSPRBG (Special CSPRBG). In particular the definition of SCSPRBG synthetizes in a simple way our proposal of how to modify a CSPRBG in order to achieve a higher throughput rate, while retaining some essential features of its computational security. We then summarize which should be, in our opinion, a "standard way" to use a CSPRBG for cryptographic purposes. We eventually present as an application, a particular SCSPRBG for which we can achieve throughput rates greater than Mbits/sec on current mobile devices.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptographic Implementations and Security · Cryptography and Residue Arithmetic · Chaos-based Image/Signal Encryption
