Pages that link to "Item:Q2499259"
From MaRDI portal
The following pages link to The complexity of certain multi-exponentiation techniques in cryptography (Q2499259):
Displaying 18 items.
- A note on asynchronous multi-exponentiation algorithm using binary representation (Q456161) (← links)
- Non-interactive multisignatures in the plain public-key model with efficient verification (Q1944042) (← links)
- PRE: stronger security notions and efficient construction with non-interactive opening (Q2015128) (← links)
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions (Q2223693) (← links)
- The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography (Q2566002) (← links)
- Succinct Diophantine-satisfiability arguments (Q2691605) (← links)
- On Group Structures Realized by Elliptic Curves over a Fixed Finite Field (Q2883919) (← links)
- On Group Structures Realized by Elliptic Curves over Arbitrary Finite Fields (Q2883920) (← links)
- Certificateless Proxy Re-Encryption Without Pairings (Q3193254) (← links)
- The new concept of path contributing to the cryptographic strength exceeding 2N (Q3443230) (← links)
- ANALYSIS OF COMPLEMENTS IN MULTI-EXPONENTIATION ALGORITHMS USING SIGNED DIGIT REPRESENTATIONS (Q3636156) (← links)
- Efficient message transmission via twisted Edwards curves (Q5145769) (← links)
- Faster Addition and Doubling on Elliptic Curves (Q5387091) (← links)
- Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations (Q5452254) (← links)
- Public Key Cryptography - PKC 2005 (Q5711564) (← links)
- Topics in Cryptology – CT-RSA 2004 (Q5901696) (← links)
- Post-quantum anonymous one-sided authenticated key exchange without random oracles (Q6169027) (← links)
- Fuzzy perspective of online games by using cryptography and cooperative game theory (Q6535579) (← links)
