Below are some questions in various subjects I encounter either through day to day work or reading tech articles and blogs.
I will put the subjects in bullets and when i find the answers i will hyper-link them to another post where I write the answer I found.
- How exceptions are implemented by compilers? How does the assembly generated by the compiler look like?
- In public key cryptography, what is the algorithm used to raise very large numbers to very large exponents? I know it uses assembly to do bit manipulation but what is the exact algorithm.
If anyone can point me to some reference to fulfill my lust to learn about any of the subjects above, I’d appreciate it.
2 Comments
Check out the Intel 64 and IA-32 Software Developer’s Manual Volume 1: Basic Architecture and Volume 3A: System Programming Guide, Part 1.
http://www.intel.com/products/processor/manuals/index.htm
Volume 1, Chapter 6, Section 4: Interrupts and Exceptions
Volume 3, Chapter 5: Interrupt and Exception Handling
See
http://en.wikipedia.org/wiki/Modular_exponentiation
http://en.wikipedia.org/wiki/Montgomery_reduction
http://en.wikipedia.org/wiki/Exponentiation_by_squaring
for algorithms to perform the modular exponentiation used in public key cryptography.