The following pages link to Yasuyuki Nogami (Q958597):
Displaying 21 items.
- A method for constructing a self-dual normal basis in odd characteristic extension fields (Q958601) (← links)
- Solving 114-bit ECDLP for a Barreto-Naehrig curve (Q1642460) (← links)
- Highly efficient \(\mathrm{GF}(2^8)\) inversion circuit based on redundant GF arithmetic and its application to AES design (Q1695850) (← links)
- Efficient optimal ate pairing at 128-bit security level (Q1746839) (← links)
- Equivalent keys of a nonlinear filter generator using a power residue symbol (Q1995503) (← links)
- Secure GCM implementation on AVR (Q2413216) (← links)
- Faster ECC over $$\mathbb {F}_{2^{521}-1}$$ F 2 521 - 1 (feat. NEON) (Q2806769) (← links)
- Discrete Logarithms for Torsion Points on Elliptic Curve of Embedding Degree $$1$$ (Q2942827) (← links)
- An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication (Q2988347) (← links)
- A METHOD FOR CONSTRUCTING A PSEUDO SELF-DUAL NORMAL BASIS (Q3065868) (← links)
- Accelerating Twisted Ate Pairing with Frobenius Map, Small Scalar Multiplication, and Multi-pairing (Q3578260) (← links)
- Mixed Bases for Efficient Inversion in ${{\mathbb F}{((2^2)^2)}{2}}$ and Conversion Matrices of SubBytes of AES (Q3583455) (← links)
- Integer Variable χ–Based Ate Pairing (Q3600504) (← links)
- Very Short Critical Path Implementation of AES with Direct Logic Gates (Q4912402) (← links)
- Multiplication and squaring in cubic and quartic extensions for pairing based cryptography (Q4993000) (← links)
- Exponentiation Inversion Problem Reduced from Fixed Argument Pairing Inversion on Twistable Ate Pairing and Its Difficulty (Q5253644) (← links)
- Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic Group (Q5271859) (← links)
- A High-Speed Square Root Algorithm in Extension Fields (Q5385549) (← links)
- A Method for Distinguishing the Two Candidate Elliptic Curves in CM Method (Q5450905) (← links)
- Skew Frobenius Map and Efficient Scalar Multiplication for Pairing–Based Cryptography (Q5502763) (← links)
- Pseudo 8–Sparse Multiplication for Efficient Ate–Based Pairing on Barreto–Naehrig Curve (Q5746230) (← links)
