Abstract
The security of the public key distribution (PKD) system in matrix rings proposed by Odoni, Varadharajan and Sanders is investigated. In general, the strength depends on the difficulty of taking logarithms infinite cyclic groups.
| Original language | English |
|---|---|
| Pages (from-to) | 46-47 |
| Number of pages | 2 |
| Journal | Electronics Letters |
| Volume | 22 |
| Issue number | 1 |
| Publication status | Published - 2 Jan 1986 |
| Externally published | Yes |