| On the boomerang uniformity of permutations of low Carlitz rank | 0 | 0.34 | 2022 |
| A refinement of Müller's cube root algorithm | 0 | 0.34 | 2020 |
| On cryptographic parameters of permutation polynomials of the form x. | 0 | 0.34 | 2019 |
| On r-th Root Extraction Algorithm in 𝔽q for q≍lrs+1;(mod; rs+1) with 0<l<r and Small s. | 0 | 0.34 | 2016 |
| New cube root algorithm based on the third order linear recurrence relations in finite fields | 2 | 0.66 | 2015 |
| An Improvement of the Cipolla-Lehmer Type Algorithms. | 0 | 0.34 | 2015 |
| Remarks on the Pocklington and Padr\'o-S\'aez Cube Root Algorithm in $\mathbb F_q$. | 0 | 0.34 | 2014 |
| Square Root Algorithm in Fq for q≡2s+1 (mod 2s+1). | 0 | 0.34 | 2013 |
| Trace Expression of r-th Root over Finite Field. | 0 | 0.34 | 2013 |
| On r-th Root Extraction Algorithm in Fq For q≡lrs+1 (mod rs+1) with 0 < l < r and Small s. | 0 | 0.34 | 2013 |
| On Nonlinear Polynomial Selection and Geometric Progression (mod N) for Number Field Sieve. | 0 | 0.34 | 2011 |
| Area-Time Efficient Implementation of the Elliptic Curve Method of Factoring in Reconfigurable Hardware for Application in the Number Field Sieve | 2 | 0.40 | 2010 |
| Reconfigurable Computing Approach for Tate Pairing Cryptosystems over Binary Fields | 7 | 0.54 | 2009 |
| More efficient systolic arrays for multiplication in GF(2m) using LSB first algorithm with irreducible polynomials and trinomials | 4 | 0.42 | 2009 |
| FPGA accelerated multipliers over binary composite fields constructed via low hamming weight irreducible polynomials | 0 | 0.34 | 2008 |
| Efficient Flexible Batch Signing Techniques for Imbalanced Communication Applications | 2 | 0.49 | 2008 |
| FPGA implementation of high performance elliptic curve cryptographic processor over GF | 3 | 0.38 | 2008 |
| New Hardware Architecture for Multiplication over GF(2m) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography | 0 | 0.34 | 2008 |
| An optimized hardware architecture for the montgomery multiplication algorithm | 17 | 1.41 | 2008 |
| Implementing the elliptic curve method of factoring in reconfigurable hardware | 13 | 1.11 | 2006 |
| Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields | 0 | 0.34 | 2006 |
| Fpga Accelerated Tate Pairing Based Cryptosystems Over Binary Fields | 8 | 0.51 | 2006 |
| A digit-serial multiplier for finite field GF(2m) | 35 | 1.50 | 2005 |
| A fast digit-serial systolic multiplier for finite field GF(2m) | 11 | 0.71 | 2005 |
| A novel arithmetic unit over GF(2m) for low cost cryptographic applications | 1 | 0.40 | 2005 |
| Compact linear systolic arrays for multiplication using a trinomial basis in GF(2m) for high speed cryptographic processors | 1 | 0.36 | 2005 |
| New architecture for multiplication in GF(2m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography | 1 | 0.36 | 2005 |
| Efficient tate pairing computation for elliptic curves over binary fields | 14 | 1.22 | 2005 |
| A new digit-serial systolic mulitplier for high performance GF(2m) applications | 0 | 0.34 | 2005 |
| Efficient linear array for multiplication over NIST recommended binary fields | 0 | 0.34 | 2005 |
| Unidirectional two dimensional systolic array for multiplication in GF(2m) using LSB first algorithm | 0 | 0.34 | 2005 |
| Fast irreducibility testing for XTR using a gaussian normal basis of low complexity | 0 | 0.34 | 2004 |
| Signed digit representation with NAF and balanced ternary form and efficient exponentiation in GF(qn) using a Gaussian normal basis of type II | 0 | 0.34 | 2004 |
| Efficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields. | 11 | 1.23 | 2004 |
| Efficient bit-serial systolic array for division over GF(2/sup m/) | 0 | 0.34 | 2003 |
| A low complexity and a low latency bit parallel systolic multiplier over GF(2m) using an optimal normal basis of type II | 30 | 1.11 | 2003 |
| A New Arithmetic Unit in GF(2m) for Reconfigurable Hardware Implementation | 0 | 0.34 | 2003 |
| A systolic multiplier with LSB first algorithm over GF(2m) which is as efficient as the one with MSB first algorithm | 4 | 0.49 | 2003 |
| Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic | 1 | 0.35 | 2003 |
| A Compact and Fast Division Architecture for a Finite Field | 1 | 0.38 | 2003 |
| Efficient Bit Serial Multiplication Using Optimal Normal Bases of Type II in GF (2m) | 2 | 0.54 | 2002 |
| Low Complexity Bit Serial Systolic Multipliers over GF(2m) for Three Classes of Finite Fields | 0 | 0.34 | 2002 |
| Majority-Voting FCM Algorithm in the Vague Fuzzy Classification. | 0 | 0.34 | 2001 |
