<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Random Number Generator on Insinuator.net - Bold Statements</title>
    <link>https://insinuator.net/tags/random-number-generator/</link>
    <description>Recent content in Random Number Generator on Insinuator.net - Bold Statements</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Thu, 29 Nov 2018 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://insinuator.net/tags/random-number-generator/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>On the insecurity of math.random and it’s siblings</title>
      <link>https://insinuator.net/2018/11/on-the-insecurity-of-math.random-and-its-siblings/</link>
      <pubDate>Thu, 29 Nov 2018 00:00:00 +0000</pubDate>
      <guid>https://insinuator.net/2018/11/on-the-insecurity-of-math.random-and-its-siblings/</guid>
      <description>&lt;p&gt;During code reviews we often see developers using weak RNGs like &lt;em&gt;math.random()&lt;/em&gt; to generate cryptographic secrets. We think it is commonly known that weak random number generators (RNG) must not be used for any kind of secret and recommend using secure alternatives. I explicitly did not state a specific language yet, because basically every language offers both weak and strong RNGs.&lt;/p&gt;&#xA;&lt;p&gt;So I asked myself: What if I use a weak RNG to generate a secret? Is it possible to recover the secret from some derived value, like a hash?&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
