We construct two public key cryptosystems defined by using one-factorizations of a complete graph. The security of these cryptosystems is based on the result that an isomorphism between two one-factorizations of a complete graph can be computed in sub-exponential time.

Cryptosystems involving one-factorizations of graphs / R. Stangarone; L. Verdi. - In: JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY. - ISSN 0972-0529. - STAMPA. - 12:(2009), pp. 737-743. [10.1080/09720529.2009.10698269]

Cryptosystems involving one-factorizations of graphs

STANGARONE, ROSA;VERDI, LUISELLA
2009

Abstract

We construct two public key cryptosystems defined by using one-factorizations of a complete graph. The security of these cryptosystems is based on the result that an isomorphism between two one-factorizations of a complete graph can be computed in sub-exponential time.
2009
12
737
743
R. Stangarone; L. Verdi
File in questo prodotto:
File Dimensione Formato  
Cryptosystems.pdf

Accesso chiuso

Tipologia: Versione finale referata (Postprint, Accepted manuscript)
Licenza: Tutti i diritti riservati
Dimensione 192.74 kB
Formato Adobe PDF
192.74 kB Adobe PDF   Richiedi una copia

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/385490
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact