On the key expansion of \(D(n, K)\)-based cryptographical algorithm
From MaRDI portal
Publication:2442944
DOI10.2478/v10065-011-0014-7zbMath1284.94120OpenAlexW2015257352MaRDI QIDQ2442944
Vasiliy A. Ustimenko, Aneta Wróblewska
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-0014-7
Applications of graph theory (05C90) Cryptography (94A60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Authentication, digital signatures and secret sharing (94A62)
Related Items
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
Cites Work
- Explicit constructions of graphs without short cycles and low density codes
- Graphs with special arcs and cryptography
- Explicit construction of graphs with an arbitrary large girth and of large size
- A characterization of the components of the graphs \(D(k,q)\)
- On the key exchange with nonlinear polynomial maps of stable degree
- Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
- On the key exchange and multivariate encryption with nonlinear polynomial maps of stable degree
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item