Explore >> Select a destination
|
You are here 
|
esham.io | ||
| | | | |
rupertmckay.com
|
|
| | | | | Rounding errors are inevitable. | |
| | | | |
marcospereira.me
|
|
| | | | | Understanding floating point representation can help design systems in order to make the most out of this type. | |
| | | | |
arnorhs.dev
|
|
| | | | | I read somewhere that a bitwise left shift was a faster method of removing a fraction of a floating point number in Javascript than using parseInt or Math.floor(). I wasn't surprised that parseInt was slow, since I think it parses the number as a string, but the left shift being faster than Math.floor() was a bit more puzzling to me. So I decided to make a JSPerf test to compare those three methods. Read on for the full results | |
| | | | |
www.eliza-ng.me
|
|
| | | Introduction: Cryptography, the art of secure communication, relies on robust and trustworthy encryption algorithms to safeguard sensitive information. However, concerns about a potential backdoor in the NIST-approved Dual_EC_DRBG random number generator have plagued the encryption community for years. This article examines the history, suspicions, and implications surrounding the controversial algorithm. Background: Dual_EC_DRBG, based on elliptic curve cryptography, was included in NIST's SP 800-90A publication as one of the recommended random number generators for use in cryptography. However, from the beginning, doubts were raised about the algorithm's security and potential weaknesses. Later, it was publicly revealed that the United States National Security Agency (NSA) had likely inserted a kleptographic backdoor into the algorithm, further fueling concerns. | ||
