How to implement bignum arithmetic
- Type
- Audio
- Tags
- cryptography, SSL
- Authors
- Felix von Leitner
- Event
- Chaos Communication Congress 23th (23C3) 2006
- Indexed on
- Mar 27, 2013
- URL
- http://dewy.fem.tu-ilmenau.de/CCC/23C3/audio/23C3-1658-en-bignum_arithmetic.mp3
- File name
- 23C3-1658-en-bignum_arithmetic.mp3
- File size
- 43.2 MB
- MD5
- 7bb2158205c087551683c149e29eef07
- SHA1
- c6326a8a617e650bd26e2fd8b1e0a67e0d7cc8f0
Assembly language skills are a bonus, but not strictly required. This lecture will explain how software like OpenSSL and GnuPG do their arithmetic on 1024 bit numbers. This is not about how RSA works, or about how AES works. This is just about how to add and multiply big numbers. I will explain the algorithms, show some code, and give some timings. Everyone knows that RSA keys are typically 1024 bits and up, but computers only operate on 32-bit or 64-bit quantities at a time. How does software like OpenSSL or GnuPG then do arithmetic on those long numbers? This talk will show how it's done.
About us
Secdocs is a project aimed to index high-quality IT security and hacking documents. These are fetched from multiple data sources: events, conferences and generally from interwebs.
Statistics
Serving 8166 documents and 531.0 GB of hacking knowledge, indexed from 2419 authors from 163 security conferences.
Contribute
To support this site and keep it alive, you can click on the buttons below. Any help is really appreciated! This service is provided for free, but real money is needed to pay bills.
