NSA and Dual EC_DRBG: Déjà Vu All Over Again?

@article{Landau2015NSAAD,
  title={NSA and Dual EC\_DRBG: D{\'e}j{\`a} Vu All Over Again?},
  author={Susan Landau},
  journal={The Mathematical Intelligencer},
  year={2015},
  volume={37},
  pages={72-83}
}
  • S. Landau
  • Published 21 October 2015
  • Computer Science
  • The Mathematical Intelligencer
F or months now, there has been vigorous debate about the National Security Agency’s (NSA) surveillance. Edward Snowden’s dramatic disclosures of classified documents touched it off, but some of the issues have been with us for years. What level of domestic and international surveillance should the U.S. government be conducting? All the reports and Congressional hearings have left things largely unsettled. One of the most striking of the Snowden revelations was that the NSA had subverted the… 
1 Citations
U.S. Security Policy: The Dual-Use Regulation of Cryptography and its Effects on Surveillance
TLDR
The impact of the dual-use regulation in the United States has affected the efficiency of surveillance technology, by loosening regulations only for mass communication services, thereby supporting the proliferation of surveillance intermediaries, while working on strategies to collaborate and exploit their coverage.

References

SHOWING 1-10 OF 12 REFERENCES
ZERO KNOWLEDGE AND THE DEPARTMENT OF DEFENSE
TLDR
Three Israeli computer scientists figured out how to play the game, called "zero knowledge proofs of identity", and the National Security Agency (NSA), the government decrypter of secrets, stepped in to help.
The Mathematics Community and the NSA: Encryption and the NSA Role in International Standards
“AMS Should Sever Ties with the NSA” (Letter to the Editor), by Alexander Beilinson (December 2013); “Dear NSA: Long-Term Security Depends on Freedom”, by Stefan Forcey (January 2014); “The NSA
Crypto: How the Code Rebels Beat the Government--Saving Privacy in the Digital Age
TLDR
Crypto tells the inside story of how a group of "crypto rebels" teamed up with corporate interests to beat Big Brother and ensure the authors' privacy on the Internet.
Polynomials in the Nation's Service: Using Algebra to Design the Advanced Encryption Standard
  • S. Landau
  • Computer Science, Mathematics
    Am. Math. Mon.
  • 2004
TLDR
It is shown how polynomials came to play a critical role in what may become the most widely-used algorithm of the new century, Data Encryption Standard (DES), which, aside from RC4 in web browsers and relatively insecure cable-TV signal encryption, is the most popular cryptosystem in the world.
The Data Encryption Standard (DES) and its strength against attacks
TLDR
Some of the safeguards against differential cryptanalysis that were built into the DES system from the beginning are shown, with the result that more than 10 15 bytes of chosen plaintext are required for this attack to succeed.
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important
Biclique Cryptanalysis of the Full AES
TLDR
This paper presents the novel technique of block cipher cryptanalysis with bicliques, which leads to the following results: the first key recovery method for the full AES-128 with computational complexity 2126.1.4 and key recovery methods with lower complexity for the reduced-round versions of AES not considered before.
Cracking DES - secrets of encryption research, wiretap politics and chip design: how federal agencies subvert privacy
TLDR
This controversial book reveals the full technical details on how researchers and data recovery engineers can build a DES cracker, including design specifications and board schematics, as well as full source code for the custom chip.
Conjectured Security of the ANSI-NIST Elliptic Curve RNG
TLDR
This paper proves that, if three conjecture are true, then the ECRNG is secure, and the three conjectures are hardness of the elliptic curve decisional Diffie-Hellman problem and the hardness of two newer problems, the x-logarithmproblem and the truncated point problem.
...
...