Articles

(Jan 18) #encryption #rsa

The Rivest-Shamir-Adlemen (RSA) algorithm has been around since 1977. Today it is commonly used to encrypt messages between users by using private and public keys. In Jacob's article he breaks down what makes up the structure of a public RSA key by manually parsing its hexadecimal content using a part of the Abstract Syntax Notation One encoding rules specific to binary called the Distinguished Encoding Rules (DER).

(Jan 17) #math #java

Reservoir sampling is a family of randomized algorithms for choosing a simple random sample without replacement of items from a population of unknown size in a single pass. Often times the population size is too large to hold in main memory at one time, so the algorithm makes choices in parts "blindly". In this math-heavy article, Richard Startin explores the math for five algorithms (the latter three are reservoir algorithms), implements the three reservoir algorithms in Java, and compares their benchmarks.

(Jan 09) #security #sha #encryption

Secure Hash Algorithm 1 (SHA-1) is a cryptographic hash function which produces a 160-bit hash value from an input. Although it hasn't been considered secure since 2005, the resources required to crack it still made it out of reach for most attackers. In this article by Tara Seals, she presents some newly conducted research that has substantially simplified the complexity and lowered the cost of carrying out an attack on a SHA-1 system, with estimates that such an attack can be carried out for as low as $11,000.

And that''s it for today! Discuss this issue at our subreddit r/morningcupofcoding.

Did you like what you read? Let us know by clicking one of the links below.

Liked - Disliked

I hope you enjoyed reading the latest issue of Morning Cup of Coding. If you did, consider supporting us by becoming a patron (Patreon) for perks like ad-free issues, or via a one-time donation via PayPal.

Interested in sponsoring our newsletter? Click here to send us an email.

Cheers,

Pek