Search results

...on walks in a [[supersingular isogeny graph]] and was designed to resist [[cryptanalytic attack]] by an adversary in possession of a [[quantum computer]]. Before it ...lower [[time complexity]] than on classical computers. That is, [[quantum algorithms]] can solve certain problems faster than the most efficient algorithm runni ...

...on the [[MuHASH]] [[hash algorithm]], that has not yet been successfully [[Cryptanalytic attack|attacked]]. However, MuHASH is too inefficient for practical use and Four ECOH algorithms were proposed, ECOH-224, ECOH-256, ECOH-384 and ECOH-512. The number repres ...

...te web|last=Schneier|first=Bruce|title=SIMON and SPECK: New NSA Encryption Algorithms |work=Schneier on Security |date=July 2013 |url=https://www.schneier.com/bl The designers state that NSA cryptanalysis found the algorithms to have no weaknesses, and security commensurate with their key lengths.<re ...

LEA is one of the cryptographic algorithms approved by the Korean Cryptographic Module Validation Program (KCMVP) and ...gin to the whole rounds ratio is greater than 37% against various existing cryptanalytic techniques for block ciphers. ...

For small message sizes, the creators of the Keccak algorithms and the SHA-3 functions suggest using the faster function [[#KangarooTwelve ...of 2008. Keccak was accepted as one of the 51 candidates. In July 2009, 14 algorithms were selected for the second round. Keccak advanced to the last round in De ...