Skip to content
ECCHacks (31c3) episode artwork

EPISODE · Dec 27, 2014 · 55 MIN

ECCHacks (31c3)

from Chaos Computer Club - archive feed (high quality) · host djb, Tanja Lange

This talk will explain how to work with elliptic curves constructively to obtain secure and efficient implementations, and will highlight pitfalls that must be avoided when implementing elliptic-curve crypto (ECC). The talk will also explain what all the buzz in curve choices for TLS is about. This talk does not require any prior exposure to ECC. about this event: http://events.ccc.de/congress/2014/Fahrplan/events/6369.html

Episode metadata supplied by the publisher feed · Published Dec 27, 2014

Embed this episode

Ready to play

ECCHacks (31c3)

0:00 55:37

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

No similar podcasts found.

Frequently Asked Questions

How long is this episode of Chaos Computer Club - archive feed (high quality)?

This episode is 55 minutes long.

When was this Chaos Computer Club - archive feed (high quality) episode published?

This episode was published on December 27, 2014.

Can I download this Chaos Computer Club - archive feed (high quality) episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!