Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato

From MaRDI portal
Revision as of 15:23, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5906858

zbMath0890.94001MaRDI QIDQ5906858

Neal Koblitz

Publication date: 8 February 1998

Published in: Algorithms and Computation in Mathematics (Search for Journal in Brave)




Related Items (64)

A one-way function from thermodynamics and applications to cryptographyPolly cracker, revisitedLinear complexity of some sequences derived from hyperelliptic curves of genus 2Algorithmic problems in right-angled Artin groups: complexity and applicationsHypergroupoids and cryptosystemsOn the security of biquadratic \(C^\ast\) public-key cryptosystems and its generalizationsCrypto Galore!A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass pointAlgebro-geometric solution of the discrete KP equation over a finite field out of a hyperelliptic curveOn small world semiplanes with generalised Schubert cellsUnnamed ItemIrreducible compositions of polynomials over finite fields of even characteristicOn Eulerian semigroups of multivariate transformations and their cryptographic applicationsEfficient RSA key generation and threshold Paillier in the two-party settingCryptanalysis of the TRMS Signature Scheme of PKC’05Monoidal categories, representation gap and cryptographyOn New Examples of Families of Multivariate Stable Maps and their Cryptographical ApplicationsConstructing and deconstructing intentional weaknesses in symmetric ciphersOn new protocols of Noncommutative Cryptography in terms of homomorphism of stable multivariate transformation groupsFactoring integers and oracles for elliptic and hyperelliptic curvesLattice polly cracker cryptosystemsPolly Two: a new algebraic polynomial-based public-key schemeGröbner basis cryptosystemsCryptosystems using linear groupsOn families of graphs of large cycle indicator, matrices of large order and key exchange protocols with nonlinear polynomial maps of small degreeOn the comparison of cryptographical properties of two different families of graphs with large cycle indicatorMontgomery Ladder for All Genus 2 Curves in Characteristic 2A note on the kernel of group homomorphism of the Weil descent methodPerformance of algebraic graphs based stream-ciphers using large finite fieldsThe implementation of cubic public keys based on a new family of algebraic graphsPreimage selective trapdoor function: how to repair an easy problemA Cryptanalysis of the Double-Round Quadratic CryptosystemSelection of secure hyperelliptic curves of \textit{g=2} based on a subfieldEta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\)Counting isomorphism classes of pointed hyperelliptic curves of genus 4 over finite fields with odd characteristicThe Diffie-Hellman key exchange protocol and non-Abelian nilpotent groupsExtending the GLS endomorphism to speed up GHS Weil descent using MagmaA new method for decomposition in the Jacobian of small genus hyperelliptic curvesOn the key exchange with new cubical maps based on graphsOn the family of cubical multivariate cryptosystems based on the algebraic graph over finite commutative rings of characteristic 2Algebraic curves and cryptographyA ciphertext-only attack on Polly TwoIsomorphism classes of hyperelliptic curves of genus 3 over finite fieldsFormulae for arithmetic on genus 2 hyperelliptic curvesSupersingular hyperelliptic curves of genus 2 over finite fieldsAn algorithm to compute volcanoes of 2-isogenies of elliptic curves over finite fieldsComputing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential timeA generic approach to searching for JacobiansOn the iterations of the maps \(ax^{2^k}+b\) and \((a x^{2^k} + b)^{-1}\) over finite fields of characteristic twoQuantum algorithms for algebraic problemsGeometric characterization of strongly normal extensionsInterpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\).A public key cryptosystem using a group of permutation polynomialsOn the complexity of the discrete logarithm and Diffie-Hellman problemsOn counting and generating curves over small finite fieldsA double large prime variation for small genus hyperelliptic index calculusGeneric groups, collision resistance, and ECDSAPublic-key cryptography and invariant theoryLinear complexity of sequences on Koblitz curves of genus 2On Dynamical Systems of Large Girth or Cycle Indicator and Their Applications to Multivariate CryptographyAn explicit construction for \(n\)-contact curves to a smooth cubic via divisions of polynomials and Zariski tuplesComputing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fieldsAlmost Primality of Group Orders of Elliptic Curves Defined over Small Finite FieldsRecurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.






This page was built for publication: Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato