Efficient computation of singular moduli with application in cryptography

DOI10.1007/3-540-44669-9_9MaRDI QIDQ4782698zbMATH OpenFDO

Authors Harald Baier

Publication date 2 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2138/21380071

zbMATH Keywords

class groupcomplex multiplicationcryptographyelliptic curveFourier seriesmodular functionring class polynomialsingular modulus

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• Optimized Modular Multiplication for Supersingular Isogeny Diffie-Hellman
• scientific article; zbMATH DE number 4179277
• Efficient arithmetic on elliptic curve cryptography
• Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
• A new fast modular arithmetic method in public key cryptography
• Modulus search for elliptic curve cryptosystems
• Efficient Modular Arithmetic
• Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
• scientific article; zbMATH DE number 2118995

Cited in

(7)

• Efficient systolic multiplications in composite fields for cryptographic systems
• Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
• Minimal polynomials of singular moduli
• Evaluating Igusa functions
• Affine Precomputation with Sole Inversion in Elliptic Curve Cryptography
• A New Approach to the Design of Efficient Residue Generators for Arbitrary Moduli
• Optimized Modular Multiplication for Supersingular Isogeny Diffie-Hellman

This page was built for publication: Efficient computation of singular moduli with application in cryptography

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