Youmightgetithalfwaythrough, inwhichcaseit's 2 to 127.
But I have a way.
It's not a picniclikethatisyearsandyearsandyearsofwork, muchtoomuchwork, evenfortheworld's fastestsupercomputer.
Because 228 is a lotbiggerthanyouthink.
This'llonlygetsharderifwemakethesekeysbigger.
So 2 to 192 operationsortwotothe 256 whichisthenumbersounimaginablylarge.
Lester's notevenworryaboutit.
Ifyourencryptionisusing a key, that's 2 to 256 long, andthereisn't anotherissuewithyourciphersothatthesecuritybaseisbasedentirelyonthekey, thenthatisnotbrute, forcibleinanysense, withinthenext 10 years.
Withinthenext 30 years, itisgoodforus.
Ifthat's thecase.
Sowhichofyoushouldbeused?
Well, I meanintuitively, 256 bit.
Butactually 100 28 bitiscurrentlyoutofreachofanyattacks, butit's always a slightlymorecomplicatedinthis.
I don't developthesecomputers, butcertainlynoanytimesoon.
Sopublickeycryptographylikethis 3000 bitrs a key, forexample, thatismuchmoreaffectedbyquantumcomputersshoresarewithhim, willbasicallymakethisastrivialon a quantumcomputerasjustencryptingusingArceewouldbeon a regularcomputer.
That's notwhatyouwant.
Soif a giantcomputerappearsthatcouldharmthisproblem, thatsameQuantacomputercouldtheoreticallycompletelydestroyArceeencryption.
Sothechancesarebythetimesuch a machineexists, wewon't beusingthesebecauseofthefactthattheyhavethisinherentweakness.
But I mean, tobeclear, thetheyhavenotfactoredanywherecloseto a 3000 bitnumberwithquartercomputer, yetrightbasedquestionsaboutwhetherthat's possiblebecauseitjustthescaleofthething.