On the key expansion of $D(n, K)$-based cryptographical algorithm (Q2442944): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.2478/v10065-011-0014-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2015257352
@@ Property / OpenAlex ID: W2015257352 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474263
@@ Property / cites work: Q4474263 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3511532
@@ Property / cites work: Q3511532 / rank @@
+Normal rank
@@ Property / cites work @@
+On the key exchange and multivariate encryption with nonlinear polynomial maps of stable degree
+Normal rank
@@ Property / cites work @@
+Q3560856
@@ Property / cites work: Q3560856 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3621174
@@ Property / cites work: Q3621174 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3852212
@@ Property / cites work: Q3852212 / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit constructions of graphs without short cycles and low density codes
+Normal rank
@@ Property / cites work @@
+Explicit Construction of Families of LDPC Codes With No&amp;lt;tex&amp;gt;$4$&amp;lt;/tex&amp;gt;-Cycles
+Normal rank
@@ Property / cites work @@
+Q4705763
@@ Property / cites work: Q4705763 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with special arcs and cryptography
@@ Property / cites work: Graphs with special arcs and cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Q5467229
@@ Property / cites work: Q5467229 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5448214
@@ Property / cites work: Q5448214 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5178934
@@ Property / cites work: Q5178934 / rank @@
+Normal rank
@@ Property / cites work @@
+On the key exchange with nonlinear polynomial maps of stable degree
+Normal rank
@@ Property / cites work @@
+Q3794212
@@ Property / cites work: Q3794212 / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of the components of the graphs \(D(k,q)\)
+Normal rank
@@ Property / cites work @@
+Explicit construction of graphs with an arbitrary large girth and of large size
+Normal rank

On the key expansion of \(D(n, K)\)-based cryptographical algorithm (Q2442944): Difference between revisions

Latest revision as of 12:51, 7 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)