Close to Optimally Secure Variants of GCM

<div>The hash algorithm <span class="nowrap"><svg height="14.6294pt" id="M381" style="vertical-align:-5.34107pt" version="1.1" viewbox="-0.0498162 -9.28833 53.3352 14.6294" width="53.3352pt" 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="M828 650H570L564 622C646 614 650 609 634 524L604 366H253L281 524C296 608 308 615 382 622L388 650H132L126 622C211 615 214 609 198 524L121 122C106 42 102 35 23 28L17 0H276L282 28C196 35 191 40 206 122L243 324H597L559 123C544 42 537 35 452 28L446 0H710L716 28C632 35 628 43 643 122L719 524C735 610 741 615 822 622L828 650Z" id="g113-73"></path></g><g transform="matrix(.0091,0,0,-0.0091,10.075,3.132)"><path d="M771 650H519L511 619L537 615C578 610 579 600 539 564C444 476 379 428 336 396C312 378 281 357 252 347L283 514C300 605 304 610 388 619L395 650H134L127 619C212 610 216 605 199 514L130 140C112 41 103 38 28 31L18 0H281L288 31C201 40 198 41 216 140L246 311C274 328 289 324 315 284C393 167 458 86 528 0H686L695 31C635 37 612 45 570 97C521 156 420 285 361 367L596 549C663 601 684 609 764 620L771 650Z" id="g50-76"></path></g><g transform="matrix(.0065,0,0,-0.0065,16.6,5.233)"><path d="M518 91L498 124C471 95 432 74 423 74C415 74 414 79 421 107L477 335C501 432 472 454 441 454C416 454 391 447 361 430C308 400 221 341 163 271H161L249 660C258 700 255 708 246 708C229 708 168 680 86 673L83 640H118C155 640 159 636 149 587L25 -4L34 -12C58 -4 90 5 112 10C119 63 131 130 144 187C197 269 326 386 379 386C398 386 404 366 390 310L335 87C320 25 326 -12 356 -12C395 -12 462 24 518 91Z" id="g176-105"></path></g><g transform="matrix(.013,0,0,-0.013,21.124,0)"><path d="M300 -147C201 -63 143 98 143 270S200 602 300 686L282 710C136 610 70 450 70 271V270C70 89 136 -72 282 -170L300 -147Z" id="g113-41"></path></g><g transform="matrix(.013,0,0,-0.013,25.622,0)"><path d="M686 28C612 35 607 44 591 112C563 234 541 360 519 489L489 666L457 658L147 121C100 40 89 36 24 28L17 0H240L250 28C168 34 159 41 190 101L262 237H482C495 180 503 137 510 91C517 47 514 35 441 28L433 0H677L686 28ZM475 280H285L429 541H431L475 280Z" id="g113-66"></path></g><g transform="matrix(.013,0,0,-0.013,34.757,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,39.9,0)"><path d="M645 631C614 643 545 666 457 666C215 666 23 519 23 283C23 90 158 -16 337 -16C412 -16 489 2 522 10C543 39 590 127 606 167L580 181C519 89 459 18 348 18C201 18 122 136 122 287C122 464 244 632 435 632C544 632 602 595 608 472L639 475C643 526 645 581 645 631Z" id="g113-68"></path></g><g transform="matrix(.013,0,0,-0.013,48.584,0)"><path d="M275 270C275 450 212 609 64 710L45 686C145 604 203 442 203 270S147 -63 45 -147L64 -170C213 -68 275 89 275 270Z" id="g113-42"></path></g></svg>.</span></div>

Security and Communication Networks

alg3

Algorithm 3

Algorithm 3: Close to Optimally Secure Variants of GCM 