Skip to content
CS Topics: Rand and Xor Magic episode artwork

Nov 6, 2020 25 min

CS Topics: Rand and Xor Magic

from Zombie Coder

In this week’s episode, we dive a bit deeper into the underlying theory behind how random numbers and the importance behind the XOR operator when creating hashes. This episode does depend on pre-existing knowledge of basic boolean operators. If you aren’t familiar check out this page. GNU C Sources: Look for the linear congruential method in __random_r Sha1 Js Implementation: A well explained implementation of SHA-1 algorithm Md5 Algorithm Wikipedia Page: There’s pseudo code to try implementing in your favorite language. https://www.fourmilab.ch/hotbits/ – Get random numbers from Radioactive decay Credits: https://audionautix.com/ – Music

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

CS Topics: Rand and Xor Magic

0:00 25:30

No transcript yet.

Requests help us decide what to transcribe next.

Frequently asked questions

How long is this episode of Zombie Coder?

This episode is 25 minutes long.

When was this Zombie Coder episode published?

This episode was published on November 6, 2020.

Can I download this Zombie Coder episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.