Performance of algebraic graphs based stream-ciphers using large finite fields
DOI10.2478/v10065-011-0012-9zbMath1284.94118OpenAlexW2089513963WikidataQ122213996 ScholiaQ122213996MaRDI QIDQ2442943
Abderezak Touzene, Imene Boudelioua, Vasiliy A. Ustimenko, Marwa AlRaissi
Publication date: 2 April 2014
Published in: Annales Universitatis Mariae Curie-Skłodowska. Sectio A1. Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/v10065-011-0012-9
Symbolic computation and algebraic computation (68W30) Applications of graph theory (05C90) Linear codes (general theory) (94B05) Cryptography (94A60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items (3)
Uses Software
Cites Work
- A note on two problems in connexion with graphs
- Graphs with special arcs and cryptography
- Extremal properties of regular and affine generalized \(m\)-gons as tactical configurations
- Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
- Look-up table-based large finite field multiplication in memory constrained cryptosystems
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Performance of algebraic graphs based stream-ciphers using large finite fields