scientific article; zbMATH DE number 1303149

zbMATH Open0924.94030MaRDI QIDQ4249665FDOQ4249665

Authors: Tatsuaki Okamoto, Shigenori Uchiyama 

Publication date: 14 November 1999

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1866878
• scientific article; zbMATH DE number 708800
• scientific article; zbMATH DE number 2066373
• A public key cryptosystem based on elliptic curves over \(\mathbb{Z}/n\mathbb{Z}\) equivalent to factoring

zbMATH Keywords

elliptic curvescryptography

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Cited In (8)

• On the relations between non-interactive key distribution, identity-based encryption and trapdoor discrete log groups
• Breaking RSA may be as difficult as factoring
• Identity-Based Cryptosystems and Quadratic Residuosity
• Factoring integers and oracles for elliptic and hyperelliptic curves
• Factorization, malleability and equivalent problems
• On the security of efficient user identification scheme
• ID-based cryptography using symmetric primitives
• Some remarks on the security of the identification scheme based on permuted kernels

This page was built for publication:

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