NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 2 of 2 (0.061 seconds)

Spelling suggestions: "subject:"modular inverse"" "subject:"modular lnverse""

1

Analysis of Another Left Shift Binary GCD Algorithm

Chen, Yan-heng 14 July 2009 (has links)
In general, to compute the modular inverse is very important in information security, many encrypt/decrypt and signature algorithms always need to use it. In 2007, Liu, Horng, and Liu proposed a variation on Euclidean algorithm, which can calculate the modular inverses as simple as calculate GCDs. This paper analyzes another type of left-shift binary GCD algorithm, which is suitable for the variation and that needs the fewer bit-operations than LSBGCD, which is analyzed by Shallit, and Sorenson.
Self-test
Modular inverse
GCD
2

Design and Analysis of Modular Architectures for an RNS to Mixed Radix Conversion Multi-processor

Shivashankar, Nithin 27 October 2014 (has links)
No description available.
Computer Engineering
Residue Number System
Mixed Radix
RNS to Mixed Radix Conversion
Multi-processor FPGA
parallelization pipelining
Modular Inverse

Page generated in 0.0666 seconds