Cryptosystems involving one-factorizations of graphs (Q3574297): 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.1080/09720529.2009.10698269
+Normal rank
@@ Property / OpenAlex ID @@
+W2317195490
@@ Property / OpenAlex ID: W2317195490 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q114099792
@@ Property / Wikidata QID: Q114099792 / rank @@
+Normal rank
@@ Property / cites work @@
+A recursive construction of asymmetric 1-factorizations
+Normal rank
@@ Property / cites work @@
+Q3411976
@@ Property / cites work: Q3411976 / rank @@
+Normal rank
@@ Property / cites work @@
+New directions in cryptography
@@ Property / cites work: New directions in cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of 1-factorizations of the complete graph
+Normal rank
@@ Property / cites work @@
+One-factorizations of the complete graph—A survey
+Normal rank
@@ Property / cites work @@
+Q4332941
@@ Property / cites work: Q4332941 / rank @@
+Normal rank