appears in Cryptography.
The discrete logarithm problem based on elliptic and hyperelliptic curves has gained a lot of popularity as a cryptographic primitive. The main reason is that no subexponential algorithm for computing discrete logarithms on small genus curves is currently available, except in very special cases. Therefore curvebased cryptosystems require much smal...
Check formats, pricing, and current availability directly.
Why recommended
appears in Cryptography.
Recommendation proof is sourced from public posts, interviews, reading lists, and cited references.
No verified recommendation proof available yet.
Check formats, pricing, and availability options directly on Amazon.
Consider Cryptonomicon by Neal Stephenson. Recommended by 6 sources.
“Cryptonomicon alternates a World War II codebreaking strand with a 1990s tech/cryptography strand, offering long passages of technical explanation, logistical detail, and witty aside. Its useful part is the savoring of technical lore and the odd pleasure of seeing historical secrecy folded into modern digital schemes. Its main limitation is scope: sprawling digressions into math, military procedure, and startup minutiae repeatedly slow momentum. Tone and pace shift often, which rewards patience but frustrates readers who want a tightly focused, character-driven novel.”
Each recommendation is collected from a public source — interviews, articles, or curated lists — and linked to its original URL. Books with many verifiable recommendations from respected people rank higher.
