A New Type of Graphical Passwords Based on Odd-Elegant Labelled Graphs

<div>Four So-TOE-graphs <svg height="11.927pt" id="M373" style="vertical-align:-3.291101pt" version="1.1" viewbox="-0.0498162 -8.6359 14.1071 11.927" width="14.1071pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M673 297H417L411 270C517 261 522 258 506 183L487 92C476 38 428 19 360 19C207 19 123 132 123 287C123 472 243 631 441 631C557 631 617 583 617 469L647 472C650 545 655 604 658 632C625 643 554 666 467 666C201 666 23 502 23 278C23 90 156 -16 339 -16C410 -16 501 6 569 24C566 43 567 70 573 101L589 183C604 259 607 262 667 271L673 297Z" id="g113-72"></path></g><g transform="matrix(.0091,0,0,-0.0091,8.827,3.132)"><path d="M485 418C485 434 469 451 441 451C389 451 312 387 255 335C221 304 194 278 159 242H157L259 678C264 698 264 710 255 710C242 710 183 681 96 673L90 643L128 642C165 641 171 640 162 602L24 -5L31 -12C51 -4 81 4 110 9L145 181C154 195 180 220 205 242C233 170 263 106 291 53C318 1 335 -12 360 -12C383 -12 425 0 483 82L463 105C437 79 411 57 400 57C388 57 378 68 355 110C329 156 288 244 268 298C299 333 355 376 405 376C426 376 440 373 448 368C453 365 465 368 468 373C477 386 485 405 485 418Z" id="g50-108"></path></g></svg> with <svg height="11.439pt" id="M374" style="vertical-align:-2.15067pt" version="1.1" viewbox="-0.0498162 -9.28833 47.5013 11.439" width="47.5013pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M480 416C480 431 465 448 438 448C388 448 312 383 252 330C217 299 188 273 155 237H153L257 680C262 700 263 712 253 712C240 712 183 684 97 674L92 648L126 647C166 646 172 645 163 606L23 -6L29 -12C51 -5 77 2 107 8C115 62 130 128 142 180C153 193 179 220 204 241C231 170 259 106 288 54C317 0 336 -12 358 -12C381 -12 423 2 477 80L460 100C434 74 408 54 398 54C385 54 374 65 351 107C326 154 282 241 263 299C296 332 351 377 403 377C424 377 436 372 445 368C449 366 456 368 462 375C472 386 480 402 480 416Z" id="g113-108"></path></g><g transform="matrix(.013,0,0,-0.013,10.171,0)"><path d="M448 1V51H364C248 51 153 129 140 230H448V280H140C153 381 248 459 364 459H448V509H365C208 509 80 395 80 255S208 1 365 1H448Z" id="g117-173"></path></g><g transform="matrix(.013,0,0,-0.013,20.667,0)"><path d="M290 -163V-135C183 -126 181 -122 181 -44V583C181 662 184 666 290 675V703H120V-163H290Z" id="g113-92"></path></g><g transform="matrix(.013,0,0,-0.013,25.152,0)"><path d="M384 0V27C293 34 287 42 287 114V635C232 613 172 594 109 583V559L157 557C201 555 205 550 205 499V114C205 42 199 34 109 27V0H384Z" id="g113-50"></path></g><g transform="matrix(.013,0,0,-0.013,31.392,0)"><path d="M95 130C70 130 46 113 46 88C46 72 54 64 59 64C93 55 121 33 121 -3C121 -41 93 -68 44 -88L55 -117C117 -98 186 -56 186 22C186 91 131 130 95 130Z" id="g113-45"></path></g><g transform="matrix(.013,0,0,-0.013,36.535,0)"><path d="M456 178V225H360V632H320C217 496 115 347 20 206V178H280V106C280 40 276 34 189 27V0H445V27C364 34 360 39 360 106V178H456ZM280 225H82C149 335 214 431 278 520H280V225Z" id="g113-53"></path></g><g transform="matrix(.013,0,0,-0.013,42.775,0)"><path d="M226 -163V703H56V676C162 667 165 662 165 584V-43C165 -122 162 -126 56 -136V-163H226Z" id="g113-94"></path></g></svg> described in the proof of Theorem <a href="https://static.hindawi.com/articles/scn/volume-2018/9482345/figures/#thm3">7</a>.</div>

Security and Communication Networks

fig7

Figure 7

Figure 7: A New Type of Graphical Passwords Based on Odd-Elegant Labelled Graphs 