OpenAlex
Performance of algebraic graphs based stream-ciphers using large finite fields
Work
Year: 2011
Type: article
Abstract: Algebraic graphs D(n, q) and their analog graphs D(n, K), where K is a finite commutative ring were used successfully in Coding Theory (as Tanner graphs for the construction of LDPC codes and turbo-co... more
Cites: 16
Cited by: 8
Related to: 10
FWCI: 1.897
Citation percentile (by year/subfield): 83.59
Open Access status: green