Generalised Jacobians in Cryptography and Coding Theory

DOI10.1007/978-3-642-31662-3_1MaRDI QIDQ3166959zbMATH OpenOpenAlexFDO

Authors Florian Hess

Publication date 1 November 2012

Published in Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31662-3_1

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Recommendations

• On the security of generalized Jacobian cryptosystems
• scientific article; zbMATH DE number 1992750
• Variants of Jacobi polynomials in coding theory
• Gröbner Bases, Coding, and Cryptography
• Curves, Jacobians, and cryptography
• The emergence of Picard Jacobians in cryptography
• On the notion of Jacobi polynomials for codes
• Algebraic geometry in coding theory and cryptography
• Coding theory and algebraic curves over finite fields
• A generalization of algebraic-geometry codes

Cited in

(3)

• Variants of Jacobi polynomials in coding theory
• On the security of generalized Jacobian cryptosystems
• Algorithmic Number Theory

This page was built for publication: Generalised Jacobians in Cryptography and Coding Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166959)