Cryptosystems involving one-factorizations of graphs

Stangarone, Rosa; Verdi, Luisella

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.

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.

trova@unifi

Titolo:	Cryptosystems involving one-factorizations of graphs
Autori di Ateneo:	STANGARONE, ROSA VERDI, LUISELLA
Autori:	STANGARONE, ROSA; VERDI, LUISELLA
Data di pubblicazione:	2009
Rivista:	JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY
Volume:	12
Pagina iniziale:	737
Pagina finale:	743
Abstract:	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.
Handle:	http://hdl.handle.net/2158/385490
Appare nelle tipologie:	1a - Articolo su rivista

File in questo prodotto:

File	Descrizione	Tipologia	Licenza
Cryptosystems.pdf		Versione finale referata (Postprint, Accepted manuscript)	DRM non definito	Administrator Richiedi una copia

Utilizza questo identificativo per citare o creare un link a questo documento:
http://hdl.handle.net/2158/385490

Citazioni

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