Cryptosystems involving one-factorizations of graphs

DOI10.1080/09720529.2009.10698269MaRDI QIDQ3574297zbMATH OpenOpenAlexWikidataFDO

Authors Rosa Stangarone, Luisella Verdi

Publication date 9 July 2010

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2009.10698269

zbMATH Keywords

complete graphone-factorizationspublic key cryptography

Mathematics Subject Classification ID

Applications of graph theory (05C90) Cryptography (94A60)

Recommendations

• A ``factorization algorithm for elements of a symmetric group
• scientific article; zbMATH DE number 2102393
• scientific article; zbMATH DE number 1394312
• scientific article; zbMATH DE number 691465
• Complexity Measures for Public-Key Cryptosystems

Cites work

• A recursive construction of asymmetric 1-factorizations
• scientific article; zbMATH DE number 979131 (Why is no real title available?)
• New directions in cryptography
• On the number of 1-factorizations of the complete graph
• One-factorizations of the complete graph—A survey
• The CRC handbook of combinatorial designs

Cited in

(2)

• scientific article; zbMATH DE number 5299614 (Why is no real title available?)
• Novel public-key cryptosystem based on the problem of performing sequence of local complementations on the Paley graphs

This page was built for publication: Cryptosystems involving one-factorizations of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3574297)