Unique random number set computation

Published

2013-09-08 22:00

Collected

2026-07-08 12:45

---
id: 4582
title: "Unique random number set computation"
source_domain: blog.quarkslab.com
source_url: "https://blog.quarkslab.com/unique-random-number-set-computation.html"
published_at: "2013-09-08T22:00:00Z"
tags: ["cryptography", "c", "algorithms", "random", "leeloo", "shuffle"]
phying_url: "https://phying.com/item/4582"
lang: en
---

# Unique random number set computation

## Summary

Shuffling huge integer sets given as disjoint intervals: with naive Fisher-Yates needing 8GB for 2^31 values, the authors derive a uniform, low-memory algorithm released as the leeloo C++ library.

## Intelligence Metadata

- **Sources:** blog.quarkslab.com
- **Published:** 2013-09-08T22:00:00Z
- **Original:** https://blog.quarkslab.com/unique-random-number-set-computation.html
- **Phying News:** https://phying.com/item/4582