The following pages link to Tsuyoshi Takagi (Q203449):
Displaying 50 items.
- A Polynomial-Time Algorithm for Solving a Class of Underdetermined Multivariate Quadratic Equations over Fields of Odd Characteristics (Q2938674) (← links)
- Revisiting the Cubic UOV Signature Scheme (Q2988348) (← links)
- (Q2996285) (← links)
- An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic (Q3005589) (← links)
- GeoEnc: Geometric Area Based Keys and Policies in Functional Encryption Systems (Q3012991) (← links)
- (Q3043923) (← links)
- (Q3043945) (← links)
- Some properties of ${\tau}$-adic expansions on hyperelliptic Koblitz curves (Q3067595) (← links)
- Efficient arithmetic on subfield elliptic curves over small finite fields of odd characteristic (Q3068174) (← links)
- Efficient Identity-Based Signcryption in the Standard Model (Q3092353) (← links)
- Anonymous Encryption with Partial-Order Subset Delegation Functionality (Q3092355) (← links)
- General Fault Attacks on Multivariate Public Key Cryptosystems (Q3102780) (← links)
- Efficient system parameters for Identity-Based Encryption using supersingular elliptic curves (Q3121344) (← links)
- An experiment of number field sieve for discrete logarithm problem over $\text{GF}(p^n)$ (Q3121357) (← links)
- Heuristic counting of Kachisa-Schaefer-Scott curves (Q3121368) (← links)
- Constructing an efficient hash function from $3$-isogenies (Q3121482) (← links)
- Improvement of Faugère et al.’s Method to Solve ECDLP (Q3190018) (← links)
- Efficient Algorithm for Tate Pairing of Composite Order (Q3190025) (← links)
- On Cheater Identifiable Secret Sharing Schemes Secure against Rushing Adversary (Q3190030) (← links)
- An Experimental Study of Kannan’s Embedding Technique for the Search LWE Problem (Q3297526) (← links)
- Zero-Value Point Attacks on Elliptic Curve Cryptosystem (Q3404406) (← links)
- (Q3408092) (← links)
- Analysis of fractional window recoding methods and their application to elliptic curve cryptosystems (Q3417007) (← links)
- Power Analysis to ECC Using Differential Power Between Multiplication and Squaring (Q3452234) (← links)
- Reduction Optimal Trinomials for Efficient Software Implementation of the η T Pairing (Q3515102) (← links)
- Digital Signatures Out of Second-Preimage Resistant Hash Functions (Q3535355) (← links)
- Solving a 676-Bit Discrete Logarithm Problem in GF(36n ) (Q3562907) (← links)
- New Security Problem in RFID Systems “Tag Killing” (Q3600112) (← links)
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition (Q3600511) (← links)
- Compressed XTR (Q3612397) (← links)
- Further Security Analysis of XTR (Q3618671) (← links)
- Efficient Signcryption Key Encapsulation without Random Oracles (Q3623071) (← links)
- Efficient Multi-PKG ID-Based Signcryption for Ad Hoc Networks (Q3624282) (← links)
- An Efficient Residue Group Multiplication for the η T Pairing over ${\mathbb F}_{3^m}$ (Q3651271) (← links)
- (Q4249341) (← links)
- (Q4249646) (← links)
- (Q4364564) (← links)
- (Q4412956) (← links)
- (Q4412998) (← links)
- (Q4413332) (← links)
- (Q4413337) (← links)
- Exceptional Procedure Attack on Elliptic Curve Cryptosystems (Q4414711) (← links)
- (Q4417414) (← links)
- (Q4418547) (← links)
- (Q4428347) (← links)
- (Q4502502) (← links)
- (Q4502799) (← links)
- (Q4536638) (← links)
- Short-Memory Scalar Multiplication for Koblitz Curves (Q4589561) (← links)
- (Q4664837) (← links)
