Prev: verify symmetric cipher key?
Next: My Cryptography that is Currently on the Joke-of-the-Day site
From: WTShaw on 4 Jul 2010 10:16
On Jul 4, 8:46 am, adacrypt <austin.oby...(a)hotmail.com> wrote:

>
> PS - given that theoretically unbreakable cryptography is as rare as
> rockin' horse droppings you sound a bit patronising ? - adacrypt

Not rare, just usually awkward.

The criteria for strength are relatively simple but they are not
universally shared.

I believe you are generally on the right track but somehow you need
more rails. Perhaps the never-gonna-get-there group are more inclined
to route you around in circular arguments but I am dedicated to your
getting it all together, simplify your points to be brief and by skill
include the necessary particulars. OK, pick your best words, not so
many of them, and summarize the architecture of your most recent
system and post it here. This technique of communication, short and to
the point, is necessary to communicate with the clowns that have a
short attention span. For me. it's a shortage of time as I have so
little left.
From: adacrypt on 4 Jul 2010 11:02
On Jul 4, 3:16 pm, WTShaw <lure...(a)gmail.com> wrote:
> On Jul 4, 8:46 am, adacrypt <austin.oby...(a)hotmail.com> wrote:
>
>
>
> > PS - given that theoretically unbreakable cryptography is as rare as
> > rockin' horse droppings you sound a bit patronising ? - adacrypt
>
> Not rare, just usually awkward.
>
> The criteria for strength are relatively simple but they are not
> universally shared.
>
> I believe you are generally on the right track but somehow you need
> more rails.  Perhaps the never-gonna-get-there group are more inclined
> to route you around in circular arguments but I am dedicated to your
> getting it all together, simplify your points to be brief and by skill
> include the necessary particulars.  OK, pick your best words, not so
> many of them, and summarize the architecture of your most recent
> system and post it here. This technique of communication, short and to
> the point, is necessary to communicate with the clowns that have a
> short attention span. For me. it's a shortage of time as I have so
> little left.

Hi W.T.

>This technique of communication, short and to
>the point, is necessary to communicate with the clowns that have a
>short attention span. For me. it's a shortage of time as I have so
>little left.

Truly sorry to hear that last.

I take your point. Unfortunately this is not a well established maths
theorem that I can point readers to.

It is my private claim that emantes from undocking the Vigenere square
and moving it around to points that are (x +X), (y + X) instead of
merely the historic (x,y).

My algorithm evolves from the dynamics of doing this but always
landing later inside the square when I decrypt - not an easy concept
to envisage for anybody who is not au fait with 1) the Vigenere square
and 2) the modular arithmetic that arises 3) the notion of undocking
the square from (0,0)

Theory.

[(Key + X) +PlainText +X)] Mod N = a residue >= 0 for all N that
divides LHS just once => N must always be <= the sum [(Key + X)
+PlainText +X)] so as to leave a suitable resude

- This is a customised caveat that I am making a condition of the
residue - Finding the range of N's that will do this is something that
only the person who is au fait with modular arithmethic can understand
and I fear most readers will give up - I have created a computer
program that finds by empirical validation the range of N's (related
to X) that fill this bill - once it is understood the range of N can
written dowen directly as afunction of X i9n future for all X - X is a
positive integer - cheers -

This scalable key is powerful cryptography - much more efficient than
the vector cryptography from the same stable - adacrypt
From: adacrypt on 4 Jul 2010 12:06
On Jul 4, 4:02 pm, adacrypt <austin.oby...(a)hotmail.com> wrote:
> On Jul 4, 3:16 pm, WTShaw <lure...(a)gmail.com> wrote:
>
>
>
>
>
> > On Jul 4, 8:46 am, adacrypt <austin.oby...(a)hotmail.com> wrote:
>
> > > PS - given that theoretically unbreakable cryptography is as rare as
> > > rockin' horse droppings you sound a bit patronising ? - adacrypt
>
> > Not rare, just usually awkward.
>
> > The criteria for strength are relatively simple but they are not
> > universally shared.
>
> > I believe you are generally on the right track but somehow you need
> > more rails.  Perhaps the never-gonna-get-there group are more inclined
> > to route you around in circular arguments but I am dedicated to your
> > getting it all together, simplify your points to be brief and by skill
> > include the necessary particulars.  OK, pick your best words, not so
> > many of them, and summarize the architecture of your most recent
> > system and post it here. This technique of communication, short and to
> > the point, is necessary to communicate with the clowns that have a
> > short attention span. For me. it's a shortage of time as I have so
> > little left.
>
> Hi W.T.
>
> >This technique of communication, short and to
> >the point, is necessary to communicate with the clowns that have a
> >short attention span. For me. it's a shortage of time as I have so
> >little left.
>
> Truly sorry to hear that last.
>
> I take your point.  Unfortunately this is not a well established maths
> theorem that I can point readers to.
>
> It is my private claim that emantes from undocking the Vigenere square
> and moving it around to points that are (x +X), (y + X) instead of
> merely the historic (x,y).
>
> My algorithm evolves from the dynamics of doing this but always
> landing later inside the square when I decrypt - not an easy concept
> to envisage for anybody who is not au fait with 1) the Vigenere square
> and 2) the modular arithmetic that arises 3) the notion of undocking
> the square from (0,0)
>
> Theory.
>
> [(Key + X) +PlainText +X)] Mod N = a residue >= 0 for all N that
> divides LHS just once => N must always be <= the sum [(Key + X)
> +PlainText +X)] so as to leave a suitable resude
>
> - This is a customised caveat that I am making a condition of the
> residue - Finding the range of N's that will do this is something that
> only the person who is au fait with modular arithmethic can understand
> and I fear most readers will give up - I have created a computer
> program that finds by empirical validation the range of N's (related
> to X) that fill this bill - once it is understood the range of N can
> written dowen directly as afunction of X i9n future for all X - X is a
> positive integer - cheers -
>
> This scalable key is powerful cryptography - much more efficient than
> the vector cryptography from the same stable - adacrypt- Hide quoted text -
>
> - Show quoted text -

Hi ,

I take the view that necessity is the mother of invention and instinct
tells me that in the years ahead that necessity may come out of the
blue in cryptography and not from posting to news groups - meanwhile
there is no way that I would try and sway some ot the jeer leaders
into studying my stuff - its way over their heads anyway and they're
so used to playing with the box that cryptography comes in they really
think that is it - the gimickry and the marketing hype are
cryptography - an industry living off its defects is an apt
description - its about having a place in the crypto herd see - camp
followers mostly.

At the same time there are real experts who visit my two websites in
increasing numbers and I believe that if my stuff is ever to go
anywhere then it will be down some road of their making - remember,
the Vigenere cipher was on the table for a complete century before it
eventaully became recognised - it then lasted two centuries unbroken
until Kasiski came along.

Thank God for mathematics - nothing remains hidden for very long in
maths - altough mathematicians are also in that frame of mind of just
playing with the box today and not believing that there could be more
to come from unlikely non-specialist sources - they travel thousands
of miles to cheer each other on in mutual admiration conferences -
when will they ever learn - the emperor is stark naked but nobody
cares - cheers - adacrypt
First  |  Prev  | 
Pages: 1 2
Prev: verify symmetric cipher key?
Next: My Cryptography that is Currently on the Joke-of-the-Day site