File:NTT-Calculate-Inverse-Prime-Pseudo-Code.png
Summary
| Description |
English: Pseudo-Code showing how to implement Bezout's extension of the Euclidean Algorithm to find the inverse of a Prime Number within a Finite Field. Euclid's "Method Of Least Absolute Remainders" enhancement is not compatible with Bezout's extension. The Inverse Prime is needed to utilize Mongomery's Modulo Multiplication Method when implementing the Number Theoretic Transform. |
| Date | |
| Source | Own work |
| Author | www.JasonAndrade.ca |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
This file is licensed under the Creative Commons Attribution 3.0 Unported license.
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
