Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
This book is intended as a text for a course on cryptography, with an emphasis on algebraic methods. It is largely intended for graduate students in mathematics or computer science although it is not beyond the reach of advanced undergraduates. The first three chapters contain the background on cryptographic primitives, complexity and algebra, necessary to appreciate the last three chapters on three types of cryptographic systems: hidden monomial, combinatorial-algebraic and elliptic and hyperelliptic cryptosystems. The first chapter on cryptography reviews the idea of public key cryptosystems and includes interesting discussions on RSA, hash functions, digital signatures, Diffie-Hellman key exchange, secret sharing, coin flipping, bit commitment and cryptosystems in general. The following chapter contains an informal, yet surprisingly comprehensive and useful, discussion of the notions of complexity so necessary for an understanding of some of the fundamental results of cryptography. After some elementary results on number theory and algorithms, it considers the classes of decision problems P, NP and NP-complete, as well as the notion of problem reduction and randomized algorithms. Chapter 3 on Algebra contains the standard material on finite fields and the Euclidean algorithm for polynomials, before introducing topics such as the Hilbert basis theorem, the Hilbert nullstellensatz theorem and Gröbner bases. The final three chapters contain discussions of specific cryptosystems not well covered in other texts on the subject. Chapter 4 introduces the Imai-Matsumoto cryptosystem and the technique of Patarin in both breaking this system as well as proposing extensions and generalizations of it. The fifth chapter considers combinatorial-algebraic cryptosystems and the implications of a theorem of Brassard on such systems. The final chapter contains a review of the central problems associated with elliptic curve cryptosystems, including a discussion of the Jacobian of hyperelliptic curves, as a group for use in cryptography. An appendix on hyperelliptic curves from an algebraic-geometric perspective, written by Menezes, Wu and Zuccherato, is included. Answers to all problems in the text are also given. The book is a welcome addition to the literature of cryptography.
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
- scientific article; zbMATH DE number 5917127
- scientific article; zbMATH DE number 2154287
- Algebraic curves and cryptography
- Algebraic curves and cryptography
- Algebra for cryptography. With a preface by Massimiliano Sala
- Algebraic curves in cryptography
- Elliptic curves and their applications to cryptography. An introduction
- Cryptographic aspects of real hyperelliptic curves
- Symmetric Cryptography and Algebraic Curves
- Selection of secure hyperelliptic curves of \textit{g=2} based on a subfield
- Algorithmic problems in right-angled Artin groups: complexity and applications
- A note on the kernel of group homomorphism of the Weil descent method
- Preimage selective trapdoor function: how to repair an easy problem
- Formulae for arithmetic on genus 2 hyperelliptic curves
- Supersingular hyperelliptic curves of genus 2 over finite fields
- Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\).
- On the complexity of the discrete logarithm and Diffie-Hellman problems
- On counting and generating curves over small finite fields
- Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.
- A one-way function from thermodynamics and applications to cryptography
- Irreducible compositions of polynomials over finite fields of even characteristic
- On families of graphs of large cycle indicator, matrices of large order and key exchange protocols with nonlinear polynomial maps of small degree
- On the comparison of cryptographical properties of two different families of graphs with large cycle indicator
- Extending the GLS endomorphism to speed up GHS Weil descent using Magma
- On the iterations of the maps \(ax^{2^k}+b\) and \((a x^{2^k} + b)^{-1}\) over finite fields of characteristic two
- A public key cryptosystem using a group of permutation polynomials
- Linear complexity of sequences on Koblitz curves of genus 2
- An explicit construction for \(n\)-contact curves to a smooth cubic via divisions of polynomials and Zariski tuples
- Linear complexity of some sequences derived from hyperelliptic curves of genus 2
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Polly Two: a new algebraic polynomial-based public-key scheme
- Gröbner basis cryptosystems
- Cryptosystems using linear groups
- Performance of algebraic graphs based stream-ciphers using large finite fields
- The implementation of cubic public keys based on a new family of algebraic graphs
- Isomorphism classes of hyperelliptic curves of genus 3 over finite fields
- An algorithm to compute volcanoes of 2-isogenies of elliptic curves over finite fields
- Generic groups, collision resistance, and ECDSA
- Public-key cryptography and invariant theory
- On the security of biquadratic \(C^\ast\) public-key cryptosystems and its generalizations
- Discrete algebraic methods. Arithmetic, cryptography, automata and groups
- On small world semiplanes with generalised Schubert cells
- Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
- Algebra for cryptologists
- Algebraic curves in cryptography
- Discrete algebraic methods. Arithmetic, cryptography, automata and groups
- Polly cracker, revisited
- On dynamical systems of large girth or cycle indicator and their applications to multivariate cryptography
- Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
- Course in algebra and algorithmics. Applications to RSA and to discrete logarithm cryptology
- Crypto galore!
- On new examples of families of multivariate stable maps and their cryptographical applications
- A generic approach to searching for Jacobians
- Quantum algorithms for algebraic problems
- Almost Primality of Group Orders of Elliptic Curves Defined over Small Finite Fields
- A double large prime variation for small genus hyperelliptic index calculus
- Cryptanalysis of the TRMS Signature Scheme of PKC’05
- Montgomery Ladder for All Genus 2 Curves in Characteristic 2
- On Schubert cells in Grassmannians and new algorithms of multivariate cryptography
- Hypergroupoids and cryptosystems
- Algebra for cryptography. With a preface by Massimiliano Sala
- A new method for decomposition in the Jacobian of small genus hyperelliptic curves
- A Cryptanalysis of the Double-Round Quadratic Cryptosystem
- On the key exchange with new cubical maps based on graphs
- On the family of cubical multivariate cryptosystems based on the algebraic graph over finite commutative rings of characteristic 2
- Geometric characterization of strongly normal extensions
- Algebraic curves and cryptography
- On Eulerian semigroups of multivariate transformations and their cryptographic applications
- Monoidal categories, representation gap and cryptography
- Constructing and deconstructing intentional weaknesses in symmetric ciphers
- On new protocols of Noncommutative Cryptography in terms of homomorphism of stable multivariate transformation groups
- Factoring integers and oracles for elliptic and hyperelliptic curves
- Lattice polly cracker cryptosystems
- Public-key cryptosystems and signature schemes from \(p\)-adic lattices
- An attack on p-adic lattice public-key encryption cryptosystems and signature schemes
- On affine forestry over integral domains and families of deep Jordan-Gauss graphs
- On Schubert cells of Lie geometries and public keys of multivariate cryptography
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point
- Algebro-geometric solution of the discrete KP equation over a finite field out of a hyperelliptic curve
- Eta 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 characteristic
- The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups
- A ciphertext-only attack on Polly Two
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5906858)
