CodingTrain / CodingTrain/Suggestion-Box
Coding challenge - Drunken bishop algorithm
Open
- Dominant language
- No language data
- Stars
- 570
- Forks
- 85
- PR merge metrics
- No merged PRs in 30d
Description
Create a 2d representation of a given RSA key using the drunken bishop algorithm.
For example:
`fc:94:b0:c1:e5:b0:98:7c:58:43:99:76:97:ee:9f:b7`
to
```
+-----------------+
| .=o. . |
| . *+*. o |
| =.*..o |
| o + .. |
| S o. |
| o . |
| . . . |
| o .|
| E.|
+-----------------+
```
The algorithm has been described by [Dirk Loss](http://www.dirk-loss.de/sshvis/drunken_bishop.pdf).
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.