Modular Inverse for Integers using Fast Constant Time GCD Algorithm and its Applications

Post time 4 day(s) ago

journal：2021 31st International Conference on Field-Programmable Logic and Applications (FPL)

Authors：Sanjay Deshpande; Santos Merino del Pozo; Victor Mateu; Marc Manzano; Najwa Aaraj; Jakub Szefer

Published date：2021-8-

DOI：10.1109/fpl53798.2021.00028

PDF link：https://ieeexplore.ieee.org/stampPDF/getPDF.jsp?arnumber=9556451

Article link：https://doi.org/10.1109/fpl53798.2021.00028

Article Source：IEEE。

Remark：

Post time 4 day(s) ago

: This post has been completed
Completed attachments will be deleted within 24 hours.

[IEEE] Modular Inverse for Integers using Fast Constant Time GCD Algorithm and its Applications

Best Answer

Same Category

Latest Reply

Announcement

Daily Top Contributors

[IEEE] Modular Inverse for Integers using Fast Constant Time GCD Algorithm and its Applications Copy

Best Answer

Same Category

Latest Reply

Announcement

Daily Top Contributors

[IEEE] Modular Inverse for Integers using Fast Constant Time GCD Algorithm and its Applications