Sciweavers

Share
IJNSEC   2010
Wall of Fame | Most Viewed IJNSEC-2010 Paper
IJNSEC
2010
324views more  IJNSEC 2010»
8 years 10 months ago
Computing the Modular Inverse of a Polynomial Function over GF(2P) Using Bit Wise Operation
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
Rajaram Ramasamy, Amutha Prabakar Muniyandi
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source324
2Download preprint from source247
3Download preprint from source163
4Download preprint from source152
5Download preprint from source151
6Download preprint from source146
7Download preprint from source145
8Download preprint from source144
9Download preprint from source143
10Download preprint from source143
11Download preprint from source141
12Download preprint from source138
13Download preprint from source133
14Download preprint from source128
15Download preprint from source127
16Download preprint from source127
17Download preprint from source126
18Download preprint from source120
19Download preprint from source116
20Download preprint from source112
21Download preprint from source105
22Download preprint from source104
23Download preprint from source100
24Download preprint from source98
25Download preprint from source98
26Download preprint from source91
27Download preprint from source73
28Download preprint from source66
29Download preprint from source66
books