On Cryptographic Schemes Based on Discrete Logarithms and Factoring

DOI10.1007/978-3-642-10433-6_3MaRDI QIDQ3648463zbMATH OpenOpenAlexFDO

Authors Marc Joye

Publication date 26 November 2009

Published in Cryptology and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10433-6_3

zbMATH Keywords

ACJT group signaturescompressiondiscrete logarithm problemfactoring problemring \(\mathbb Z_{N }\)Torus-based cryptography

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Recommendations

• Advances in Cryptology - CRYPTO 2003
• Practical Cryptography in High Dimensional Tori
• Asymptotically optimal communication for torus-based cryptography
• Compression in Finite Fields and Torus-Based Cryptography
• A new signature scheme based on factoring and discrete logarithms

Cited in

(7)

• Generating parameters for algebraic torus-based cryptosystems
• Public-key cryptosystem design based on factoring and discrete logarithms
• scientific article; zbMATH DE number 2154291 (Why is no real title available?)
• Cryptographic protocols based on discrete logarithms in real-quadratic orders
• Asymptotically optimal communication for torus-based cryptography
• Practical Cryptography in High Dimensional Tori
• Advances in Cryptology - CRYPTO 2003

This page was built for publication: On Cryptographic Schemes Based on Discrete Logarithms and Factoring

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