Pages that link to "Item:Q1120276"
From MaRDI portal
The following pages link to A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases (Q1120276):
Displayed 48 items.
- Effective compression maps for torus-based cryptography (Q264119) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- Quantum-assisted QD-CFS signatures (Q473200) (← links)
- Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\) (Q510481) (← links)
- Characterization for a family of infinitely many irreducible equally spaced polynomials (Q750156) (← links)
- An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation (Q834951) (← links)
- Improved generalized Atkin algorithm for computing square roots in finite fields (Q844143) (← links)
- Efficient software-implementation of finite fields with applications to cryptography (Q850780) (← links)
- A Euclidean algorithm for normal bases (Q850785) (← links)
- Efficient hardware implementation of finite fields with applications to cryptography (Q850794) (← links)
- Tate and Ate pairings for \(y^2=x^5-\alpha x\) in characteristic five (Q957691) (← links)
- An extension of TYT inversion algorithm in polynomial basis (Q991790) (← links)
- High-performance hardware architecture of elliptic curve cryptography processor over \(\text{GF}(2^{163})\) (Q1045615) (← links)
- Structure of parallel multipliers for a class of fields \(GF(2^ m)\) (Q1124585) (← links)
- Computational problems in the theory of finite fields (Q1180998) (← links)
- A simple stream cipher with proven properties (Q1947647) (← links)
- Fast polynomial inversion for post quantum QC-MDPC cryptography (Q2051829) (← links)
- Some efficient quantum circuit implementations of Camellia (Q2107075) (← links)
- Implementing Grover oracles for quantum key search on AES and LowMC (Q2119015) (← links)
- Koblitz curves over quadratic fields (Q2318090) (← links)
- Logic minimization techniques with applications to cryptology (Q2377070) (← links)
- Parallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials (Q2384054) (← links)
- Efficient computation of roots in finite fields (Q2491305) (← links)
- Elliptic periods for finite fields (Q2517811) (← links)
- On the structure of digital explicit nonlinear and inversive pseudorandom number generators (Q2655800) (← links)
- Quantum circuit implementations of AES with fewer qubits (Q2692402) (← links)
- Taking roots over high extensions of finite fields (Q2862538) (← links)
- Fast Implementation of Curve25519 Using AVX2 (Q2946458) (← links)
- On Fast Calculation of Addition Chains for Isogeny-Based Cryptography (Q2980864) (← links)
- Efficient Multiplication in Finite Field Extensions of Degree 5 (Q3011913) (← links)
- An Analysis of Affine Coordinates for Pairing Computation (Q3059636) (← links)
- Parallelizing the Weil and Tate Pairings (Q3104701) (← links)
- On design of circuits of logarithmic depth for inversion in finite fields (Q3184560) (← links)
- Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$ (Q3455496) (← links)
- Fast Point Decompression for Standard Elliptic Curves (Q3506353) (← links)
- Optimal Extension Field Inversion in the Frequency Domain (Q3519551) (← links)
- Efficient Finite Fields in the Maxima Computer Algebra System (Q3519552) (← links)
- Integer Variable χ–Based Ate Pairing (Q3600504) (← links)
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ (Q3600512) (← links)
- Computing special powers in finite fields (Q4813594) (← links)
- Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors (Q4916008) (← links)
- High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions (Q4960943) (← links)
- Digital inversive vectors can achieve polynomial tractability for the weighted star discrepancy and for multivariate integration (Q5270132) (← links)
- High Speed Compact Elliptic Curve Cryptoprocessor for FPGA Platforms (Q5504637) (← links)
- (Q5869338) (← links)
- A comparison of different finite fields for elliptic curve cryptosystems (Q5948821) (← links)
- Concrete quantum cryptanalysis of binary elliptic curves via addition chain (Q6080896) (← links)
- Efficiently masking polynomial inversion at arbitrary order (Q6166989) (← links)