The following pages link to (Q4536791):
Displaying 34 items.
- Effective compression maps for torus-based cryptography (Q264119) (← links)
- An XTR-based constant round key agreement scheme (Q474414) (← links)
- An optimal representation for the trace zero subgroup (Q521853) (← links)
- The Diffie-Hellman problem and generalization of Verheul's theorem (Q735041) (← links)
- A correspondence of certain irreducible polynomials over finite fields (Q765810) (← 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)
- Applications to cryptography of twisting commutative algebraic groups (Q1003699) (← links)
- Using abelian varieties to improve pairing-based cryptography (Q1027984) (← links)
- Security of polynomial transformations of the Diffie-Hellman key. (Q1418189) (← links)
- Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← links)
- Evidence that XTR is more secure than supersingular elliptic curve cryptosystems (Q1772226) (← links)
- Private authentication (Q1881255) (← links)
- New \((k,l,m)\)-verifiable multi-secret sharing schemes based on XTR public key system (Q2118860) (← links)
- Classical attacks on a variant of the RSA cryptosystem (Q2146087) (← links)
- Point compression for the trace zero subgroup over a small degree extension field (Q2340180) (← links)
- Message transmission for GH-public key cryptosystem (Q2349638) (← links)
- An overview of trace based public key cryptography over finite fields (Q2349644) (← links)
- An efficient probabilistic public-key cryptosystem over quadratic fields quotients (Q2370640) (← links)
- Algebraic generalization of Diffie-Hellman key exchange (Q2413287) (← links)
- Elliptic curve cryptography: the serpentine course of a paradigm shift (Q2430981) (← links)
- Generating elements of orders dividing \(p^6 \pm p^5 + p^4 \pm p^3 + p^2 \pm+1\) (Q2442945) (← links)
- Point Decomposition Problem in Binary Elliptic Curves (Q2806768) (← links)
- (Q3062272) (← links)
- VSH, an Efficient and Provable Collision-Resistant Hash Function (Q3593095) (← links)
- The Function Field Sieve in the Medium Prime Case (Q3593100) (← links)
- Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) (← links)
- GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS (Q5041827) (← links)
- XTR Algorithm: Efficient and Compact Subgroup Trace Representation (Q5050169) (← links)
- Efficient message transmission via twisted Edwards curves (Q5145769) (← links)
- Efficient Compression of SIDH Public Keys (Q5738894) (← links)
- High-degree Compression Functions on Alternative Models of Elliptic Curves and their Applications (Q5862340) (← links)
- Higher-dimensional sieving for the number field sieve algorithms (Q6165871) (← links)
- On the construction of certain odd degree irreducible polynomials over finite fields (Q6651904) (← links)
