Pith. sign in

REVIEW 1 cited by

Topological Graphic Passwords And Their Matchings Towards Cryptography

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1808.03324 v3 pith:YAT4FLZT submitted 2018-07-26 cs.CR cs.DM

Bing Yao , Hui Sun , Xiaohui Zhang , Yarong Mu , Yirong Sun , Hongyu Wang , Jing Su , Mingjun Zhang
show 2 more authors
Sihua Yang Chao Yang
This is my paper · ORCID
classification cs.CRcs.DM
keywords graphmatchinglabellingspartitionpasswordstheorygpwsgraphic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graphical passwords (GPWs) are convenient for mobile equipments with touch screen. Topological graphic passwords (Topsnut-gpws) can be saved in computer by classical matrices and run quickly than the existing GPWs. We research Topsnut-gpws by the matching of view, since they have many advantages. We discuss: configuration matching partition, coloring/labelling matching partition, set matching partition, matching chain, etc. And, we introduce new graph labellings for enriching Topsnut-matchings and show that these labellings can be realized for trees or spanning trees of networks. In theoretical works we explore Graph Labelling Analysis, and show that every graph admits our extremal labellings and set-type labellings in graph theory. Many of the graph labellings mentioned are related with problems of set matching partitions to number theory, and yield new objects and new problems to graph theory.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Singularity Cipher: A Topology-Driven Cryptographic Scheme Based on Visual Paradox and Klein Bottle Illusions

    cs.CR 2025-07 reject novelty 2.0 of 10

    The Singularity Cipher wraps two key-dependent permutations and illusion-based visual encoding in topological metaphors, but its security claims are unsupported and contradict cited literature.

Pith tools