Graphs with special arcs and cryptography (Q1862260): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CRYPTIM / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 05:57, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs with special arcs and cryptography |
scientific article |
Statements
Graphs with special arcs and cryptography (English)
0 references
11 March 2003
0 references
The author studies a graph theory model for encryption of messages. The vertices of a graph represent possible messages and encryption steps to edges in the graph. Special graphs of high girth naturally arise in the area. The author presents a construction of some such graphs and discusses their properties. Applications in practice are also briefly sketched in the paper.
0 references
graph models in cryptography
0 references
