scientific article; zbMATH DE number 1759768
From MaRDI portal
Publication:4536791
Recommendations
Cited in
(43)- Applications to cryptography of twisting commutative algebraic groups
- Using abelian varieties to improve pairing-based cryptography
- Security of polynomial transformations of the Diffie-Hellman key.
- Computing discrete logarithms in \(\mathbb F_{p^6}\)
- Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
- Private authentication
- New \((k,l,m)\)-verifiable multi-secret sharing schemes based on XTR public key system
- Classical attacks on a variant of the RSA cryptosystem
- Point compression for the trace zero subgroup over a small degree extension field
- Message transmission for GH-public key cryptosystem
- An overview of trace based public key cryptography over finite fields
- An efficient probabilistic public-key cryptosystem over quadratic fields quotients
- Algebraic generalization of Diffie-Hellman key exchange
- Elliptic curve cryptography: the serpentine course of a paradigm shift
- Generating elements of orders dividing \(p^6 \pm p^5 + p^4 \pm p^3 + p^2 \pm+1\)
- Effective compression maps for torus-based cryptography
- scientific article; zbMATH DE number 1583781 (Why is no real title available?)
- scientific article; zbMATH DE number 1618041 (Why is no real title available?)
- An overview of the XTR public key system
- scientific article; zbMATH DE number 5831613 (Why is no real title available?)
- XTR-Kurosawa-Desmedt scheme
- VSH, an Efficient and Provable Collision-Resistant Hash Function
- The Function Field Sieve in the Medium Prime Case
- Compressed XTR
- On the Computational Efficiency of XTR+
- Faster individual discrete logarithms in finite fields of composite extension degree
- An XTR-based constant round key agreement scheme
- scientific article; zbMATH DE number 1857515 (Why is no real title available?)
- XTR and tori
- GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS
- XTR algorithm: efficient and compact subgroup trace representation
- Efficient message transmission via twisted Edwards curves
- An optimal representation for the trace zero subgroup
- Information and Communications Security
- Efficient compression of SIDH public keys
- High-degree compression functions on alternative models of elliptic curves and their applications
- Higher-dimensional sieving for the number field sieve algorithms
- The special case of cyclotomic fields in quantum algorithms for unit groups
- On the construction of certain odd degree irreducible polynomials over finite fields
- The Diffie-Hellman problem and generalization of Verheul's theorem
- A correspondence of certain irreducible polynomials over finite fields
- Efficient hardware implementation of finite fields with applications to cryptography
- Tate and Ate pairings for \(y^2=x^5-\alpha x\) in characteristic five
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536791)
