z-logo
open-access-imgOpen Access
Deterministic methods of Ramanujan graph construction for use in cryptographic algorithms based on generalized cellular automata
Author(s) -
Petr Klyucharev
Publication year - 2018
Publication title -
prikladnaâ diskretnaâ matematika
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.222
H-Index - 4
eISSN - 2311-2263
pISSN - 2071-0410
DOI - 10.17223/20710410/42/6
Subject(s) - ramanujan's sum , cryptography , computer science , automaton , cellular automaton , algorithm , theoretical computer science , graph , mathematics , combinatorics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here