| Re: Information Theoretically Secure requirements scheme for improving and implementing intelligent encryption requiring human intervention or decision to be valid. [message #180194 is a reply to message #180193] |
Thu, 24 January 2013 05:15   |
Martin Musatov
Messages: 9
Registered: January 2013
Karma:
|
Junior Member |
|
|
On Jan 23, 9:10 pm, Martin Musatov <marty.musa...@gmail.com> wrote:
> unique_string (all letters)
> &m9#&B0+1,9m. (none of the same letters plus numbers and punctuation
> mapped equivalent to each corresponding unique character)
> &m9#&B0+1,.(none of the same letters plus numbers and punctuation
> mapped equivalent to each character in order of appearance without
> repetition)
>
> Consider the first the name.
> Consider the second the challenge key.
> Consider the third the passcode.
>
> Once a valid passcode is input it is easy to map it to the challenge
> key.
> Once a valid challenge key has been confirmed both can be checked for
> correctness.
> The process of a computer figuring out a correct passcode without
> first applying it to the challenge is information theoretically
> secure.
> Because while we know the number of variations far exceed
> computational limits and restrictions of time and memory, we also know
> the problem can theoretically be solved only when a first attempt is
> made in observance of require orders of characteristics.
> In other words the machine actually only turns on once the decision
> has been made to attempt an answer.
> To prove this consider all names and passcodes combinations are either
> on or off name and passcode combinations.
> Once a name is on there need only be provided the passcode to unlock
> the information.
> However if the name is off first must be provided to the name the
> correct challenge key to turn it on.
> Following the correct challenge key being accepted the correct
> passcode can be immediately computed and entered.
> We know based on the name certain position variables will repeat in
> the challenge code.
> The simple way to prove this is if the name has repeating characters
> completely unique and unused challenge key characters will also repeat
> in the same positions.
> Therefore the first logical step in solving the problem or finding the
> solution is to take the set of all possible characters and eliminate
> the characters used in the name.
> Once this is done we know the challenge key will consist of only
> characters remaining from the set of all possible characters once the
> name characters are removed.
>
> So if my name is "Martin Musatov", I can eliminate all
> M,a,r,t,i,n,s,o,v characters. What we are left with once the
> requirement is added the challenge code contain numbers and
> punctuation mapped equivalent is a binary form.
>
> If name is 01010101
> any NPNPNPNP will meet the valid challenge format test
> provided definitions are set for N to include all numbers and P to
> include all punctuation without repetition
> and of course 0 represents all letters and 1 represents all languages
>
> The techniques all listed above and the intellectual property rights
> associated with them are (C) Copyright 2013 Martin Musatov. They may
> be used or adapted by any entity provided partial credit is provided
> to Martin Musatov and is documented as well as when this occurs in
> conjunction with a non-public donation to a charity equal to the value
> of the contribution.
+u
|
|
|
|
Calendar
Search
Help
Members
Register
Login
Home
]