Paul Dreik: Using home made crypto for a non-cryptographic problem

Generating all the numbers in a range is easy – use a for loop! But what if we want the results in random order? Generating an ordered range and using std::shuffle requires O(N) memory as well as doing O(N) work up front. In this talk, I will show how to make use of a simple block crypto to solve this problem. A lazy number generator is implemented with O(1) space usage.



Slides: https://www.pauldreik.se/talks/202001...
Code: https://github.com/pauldreik/random_f...


Event Page:
https://gettogether.community/events/...
https://www.meetup.com/StockholmCpp/e...

Event photos: https://www.meetup.com/StockholmCpp/p...

This even was kindly hosted by Atlas Copco. https://www.atlascopco.com/

More information about C++ user groups in Sweden: https://www.swedencpp.se/

• Category

  • Science & Technology

• License

  • Creative Commons Attribution license (reuse allowed)