<div dir="ltr"><div><div><div>// incompleteness of completeness, additional oddity...<br><br> <br></div> if considering [password] as a bit-set instead of linear string,<br><br></div> such that [p|a|s|s|w|o|r|d] could itself be variable, per bit,<br>
<br></div><div> <br> ex. [pass|word|1234|bluegreen]<br><br> <br></div><div> then, if a password service used this principle, instead of<br></div><div><br> requiring just 8-12 alphanumerics plus allowed special characters<br>
</div><div><br> as the basis for /security/, instead what if it was 3-4 sets instead,<br><br></div><div> themselves having special rules...<br><br></div><div><br> [set1|set2|set3|set4]<br><br><br></div><div> in this way, a 'rolling password' could be developed in that<br>
<br></div><div> the sequence could be arbitrary or change, given the instance<br><br></div><div> or interaction, which may or may not include changing variables<br><br></div><div> (months till b-day, temperature in zipcode, etc)<br>
<br><br></div><div> in other words: <br><br></div><div><br> [password] ---> [pass][wo][r][ds]<br><br><br></div><div> whereby, via its continual dynamic state, could exist in multiple<br> <br></div><div> versions by default, and then have this managed between client/server<br>
<br><br></div><div> [1][2][3][4] ---> [2][4][1][3]<br><br><br></div><div> [pass]-[wo]-[r]-[ds] ---> [wo]-[ds]-[pass]-[r]<br><br><br></div><div> this could extend into sequences of not only alphanumerics<br>
<br></div><div> through also icons (picked amongst many on the server, thus<br><br></div><div> creating more unknowns), say choose 1 of available 20 icons,<br><br></div><div> which is not included in stored password, nor its place in<br>
<br></div><div> sequence knowable to attacker...<br><br><br></div><div> [pass][icon13][wo][r][ds] ---> [icon13][wo][ds][pass][r]<br><br><br></div><div> thus a changing string made up of subsets rearranged that<br>
<br></div><div> may even have non-stored variables [#], icons or other approach<br><br><br> [3b]-[alphanum1a]-[5e]-[32^F]-[4d]-[icon]-[2c]<br><br> [2c]-[3b]-[alphanum1a]-[4d]-[icon]-[67^F]-[5e]<br><br> <br></div>
<div> then the probabilities and computation is upped exponentially<br><br></div><div> even if accessing some part of the correct code, which may not<br><br></div><div> be reliably reused, seemingly the more subsets, more security<br>
<br></div><div> from an initial attack-- thus even if one instance of passwords<br><br> were found, they could be changed or even transformed into<br><br> another set and detach from those lost, locking out else<br><br>
deactivating the previous versions. a lot could seemingly<br><br> be done with this though a secure environment would be<br><br> required which seems difficult to guarantee if not allow<br><br></div><div> for sake of someone elses interests, known & unknown<br>
<br><br>𝓶 𝟡 𝑤</div></div>