Security of an identity-based cryptosystem and the related reductions (Q4249665)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1303149
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Security of an identity-based cryptosystem and the related reductions |
scientific article; zbMATH DE number 1303149 |
Statements
14 November 1999
0 references
elliptic curves
0 references
cryptography
0 references
0.73524010181427
0 references
Security of an identity-based cryptosystem and the related reductions (English)
0 references
This paper presents a key-distribution protocol based on an elliptic curve over the integers modulo \(n\), where \(n\) is a product of two primes and the reductions of the curve modulo these two primes are anomalous. This is used to construct a backdoor to the discrete logarithm problem using an attack on anomalous elliptic curves due to Semaev, Smart, Satoh and Araki. The authors then go on to show that their proposed scheme is breakable. Hence the paper provides a lesson in how to design and then break a cryptosystem. For the entire collection see [Zbl 0889.00042].
0 references
