File:NTT-Calculate-Inverse-Prime-Pseudo-Code.png
Jump to navigation
Jump to search
Size of this preview: 363 × 599 pixels. Other resolutions: 145 × 240 pixels | 291 × 480 pixels | 940 × 1,550 pixels.
Original file (940 × 1,550 pixels, file size: 103 KB, MIME type: image/png)
Captions
Captions
Add a one-line explanation of what this file represents
Summary[edit]
| 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[edit]
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.
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 23:42, 24 March 2017 | | 940 × 1,550 (103 KB) | Www.JasonAndrade.ca (talk | contribs) | User created page with UploadWizard |
You cannot overwrite this file.
File usage on Commons
There are no pages that use this file.
