Performance of algebraic graphs based stream-ciphers using large finite fields

DOI10.2478/v10065-011-0012-9zbMath1284.94118WikidataQ122213996 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

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

05C90: Applications of graph theory

94B05: Linear codes (general theory)

94A60: Cryptography

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

Related Items

On the comparison of cryptographical properties of two different families of graphs with large cycle indicator, The implementation of cubic public keys based on a new family of algebraic graphs, On Dynamical Systems of Large Girth or Cycle Indicator and Their Applications to Multivariate Cryptography

Uses Software

• CRYPTIM
• Galois Field Arithmetic Library
• CRYPTALL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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