The following pages link to Tadanori Teruya (Q1749294):
Displaying 11 items.
- Fast lattice basis reduction suitable for massive parallelization and its application to the shortest vector problem (Q1749295) (← links)
- On limitations and alternatives of privacy-preserving cryptographic protocols for genomic data (Q1800593) (← links)
- Faster explicit formulae for computing pairings via elliptic nets and their parallel computation (Q1800687) (← links)
- Constant-round client-aided secure comparison protocol (Q2167759) (← links)
- Attribute Based Encryption with Direct Efficiency Tradeoff (Q2822674) (← links)
- Software Implementation of an Attribute-Based Encryption Scheme (Q2982285) (← links)
- High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves (Q3059638) (← links)
- Computing fixed argument pairings with the elliptic net algorithm (Q3121365) (← links)
- The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets (Q3121447) (← links)
- Constructing Symmetric Pairings over Supersingular Elliptic Curves with Embedding Degree Three (Q5746224) (← links)
- Signature for objects: formalizing how to authenticate physical data and more (Q6573964) (← links)
