Announcing the Underhanded Crypto Contest

### Deceptive Cryptography and the Underhanded Contest At 00:00, Adam Caudill and Taylor Hornby present the winning entries of the inaugural Underhanded Crypto Contest. The competition challenged developers to write seemingly correct, benign cryptographic code containing stealthy, deniable backdoors that evade automated analysis and human code audits.

### The Educational Value of Deceptive Code Auditing At 02:01, the organizers explain the contest's defensive philosophy. By studying how adversaries construct subtle flaws with plausible deniability, security researchers and auditors can recognize deceptive design patterns in third-party libraries and national standards.

### Deconstructing the Podium Submissions At 04:02 and 06:00, the presenters review the top entries. The third-place entry used a clever Bash script that covertly leaked private key material via environment variables, while the second-place entry targeted Elliptic Curve Diffie-Hellman (ECDH) key exchange, manipulating scalar multiplication logic to force shared secrets into small, predictable subgroups.

### Asymmetric Backdoors in Elliptic Curve Parameter Selection At 08:01 and 10:00, Caudill and Hornby analyze the first-place winning submission. The implementation exploited obscure mathematical properties in curve parameter selection, creating an asymmetric backdoor where only the author—possessing private mathematical constants—can decrypt communications while the library passes standard cryptographic unit tests.

### Defensive Imperatives: Parameter Scrutiny and Formal Proofs Concluding the session, the authors emphasize that standard functional tests cannot detect intentional subversion. Ensuring cryptographic integrity requires rigorous parameter transparency, automated formal verification, and strict scrutiny of unusual mathematical shortcuts.

(AI summary — Gemini Flash)