Name
Abstract | ||
|---|---|---|
We consider keyless cryptosystem proposed recently by Dean and Goldsmith. We show by simulation that this scheme is secure even so the eavesdropper uses suboptimal decoding (zero-forcing attack) with linear complexity but if the number of legitimate and eavesdropper antennas are equal to one another. But if eavesdropper has even small advantage in number of antennas, the proposed cryptosystem occurs insecure that we prove both theoretically and experimentally. We investigate a modified scheme with inverse precoder and show that it requires untractable values of the legitimate user transmitter power. Thus Dean-Goldsmith cryptosystem seems to be insecure with practical point of view. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.23919/FRUCT.2017.8250182 | 2017 21st Conference of Open Innovations Association (FRUCT) |
Keywords | Field | DocType |
legitimate user transmitter power,linear complexity,zero-forcing attack,suboptimal decoding,eavesdropper,keyless cryptosystem,Dean-Goldsmith cryptosystem | Inverse,Transmitter,Computer science,Algorithm,Cryptosystem,Decoding methods,Linear complexity | Conference |
ISSN | ISBN | Citations |
2305-7254 | 978-1-5386-2136-3 | 0 |
PageRank | References | Authors |
0.34 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Valery I. Korzhik | 1 | 35 | 15.45 |
| Vladimir Starostin | 2 | 0 | 0.68 |
| Kseniia Akhrameeva | 3 | 0 | 0.34 |