Deterministic methods for constructing Ramanujan graphs intended for use in cryptographic algorithms based on generalized cellular automata (Q5151246)
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 7311641
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deterministic methods for constructing Ramanujan graphs intended for use in cryptographic algorithms based on generalized cellular automata |
scientific article; zbMATH DE number 7311641 |
Statements
Deterministic methods of Ramanujan graph construction for use in cryptographic algorithms based on generalized cellular automata (English)
0 references
17 February 2021
0 references
expander graph
0 references
Ramanujan graph
0 references
0 references
0 references
0.8039222955703735
0 references
0.7878493666648865
0 references
0.7836630344390869
0 references
0.7665993571281433
0 references
0.7615310549736023
0 references
