A Newbie to the group.
in [ADA]
|
Prev: Subtypes boundaries
Next: Ada in Cryptography.
From: Yannick Duchêne (Hibou57) on 15 Jun 2010 16:25 Le Tue, 15 Jun 2010 20:14:25 +0200, adacrypt <austin.obyrne(a)hotmail.com> a écrit: > Hi, > > I am a bit of a loss to interpret your meaning - Do you mean I should > promote this as something of academic interest to the refernces you > give me or is there some mistake on my part - I would appreciate it if > you enlighten me a bit - adacrypt Bycause this is the first time I see an Ada job in this area, and it looks promising. A little note: it seems there is a CRC error in the Ada source archive. I could not unpack it. On the page http://www.adacrypt.com/computerised_pad.html the link named âDOWNLOAD Joint Thin Tile Cryptography - Batch & Realtime Source Code (22Mb)â -- There is even better than a pragma Assert: a SPARK --# check. --# check C and WhoKnowWhat and YouKnowWho; --# assert Ada; -- i.e. forget about previous premises which leads to conclusion -- and start with new conclusion as premise.
From: adacrypt on 15 Jun 2010 17:20 On Jun 15, 7:50 pm, "(see below)" <yaldni...(a)blueyonder.co.uk> wrote: > On 15/06/2010 19:42, in article > 2dfafa54-b744-4670-b85a-2d59d850a...(a)q12g2000yqj.googlegroups.com, > > > > > > "adacrypt" <austin.oby...(a)hotmail.com> wrote: > > On Jun 15, 7:33 pm, adacrypt <austin.oby...(a)hotmail.com> wrote: > >> On Jun 15, 7:11 pm, "(see below)" <yaldni...(a)blueyonder.co.uk> wrote: > > >>> On 15/06/2010 16:43, in article > >>> 26d9422f-e704-458b-a6eb-c7ec70a28...(a)q12g2000yqj.googlegroups.com, > > >>> "adacrypt" <austin.oby...(a)hotmail.com> wrote: > >>>> ... I choose to learn Ada-95 in order to implement my > >>>> brainwave of factoring three-dimensional vectors and using three- > >>>> dimensional space as the encryption environment in cryptography - that > >>>> had been suggested to me by an Iraqi mathematician who had read my > >>>> work in factoring vectors and I was convinced that Ada-95 was the only > >>>> language for this ... > > >>> Why? > > >>> -- > >>> Bill Findlay > >>> <surname><forename> chez blueyonder.co.uk > > >> Hi, > > >> I take you mean why did I think Ada was the more suitable language? > > >> I had already done some casual work on factorising large numbers in > >> Ada-83. I had been introduced to cryptography by one Dr. Chalabi who I > >> had asked to read my stuff on vector factoring (see "Factoring of > >> Vectors in Vector Cryptography"http://www.adacrypt.com)-hewas > >> active in cryptography - I soon saw an algorithm in vector factoring > >> that is a one-way function in mathematics that is imminently suitable > >> for cryptography - it was pure instinct from there onwards but I was > >> convinced that the system structures of Ada-95 were ideal for what I > >> wanted to do in cryptography. The mathematical algorithm was very > >> transparent to me but it was going to be a problem at the time to > >> implement it in Ada due largely to my inexperience of programming in > >> Ada-95 - I repeat that mathematical instinct was the driving force - > >> its the only thing I claim to have in abundance - I have taught myself > >> enough Ada just to complete this work - I am a retired engineer and > >> although I revere Ada programming I have no reason to go any deeper > >> into it in a general way - adacrypt- Hide quoted text - > > >> - Show quoted text - > > > Also, > > > I have no idea how to proceed with any topic that you may think worth > > expounding at some higher level - if you see any potential perhaps you > > would let me know explicitly - I'm a bit slow on the uptake - adcrypt > > You are "convinced" that Ada was in some way "ideal". > I simply ask what is it about Ada that made you consider it ideal? > > -- > Bill Findlay > <surname><forename> chez blueyonder.co.uk- Hide quoted text - > > - Show quoted text - I need to talk around this matter for a moment - it is more important to say why it is ideal now rather than why I saw it as being ideal at the outset. A salient feature of this cryptogrpahy in additon to the mathematical algorithm that is based upon is that it uses a new concept which I have developed that I am calling mutual database cryptography. Mutual database means that the entities share some several arrays of data that are referenced i.e. indexed by the ciphertext in sequential order that gives the data the correct structure to turn scrambled meaningless characters into meaningful information. This is a piece of management technology that saves sending important vulnerable keys in transit (a sore defect in current mainstream cryptography)so that if an adversary manages to intercept the ciphertext , something that always has to be assumed as inevitable and indeed certain, then he only gets a worthless string of indexing data that is useless without the database that it relates to. The way this works is that the sending entity, industry standard pseudonym Alice, prepares her encryption program with all the necessary arrays of data that she uses to encrypt plaintext messages into ciphertext. She next creates the decryption program that enables her to check her previous encryption work by decrypting it in her own computer. When she has tweaked this to perfection she sends an exact copy of her joint encryption/decryption program(s) to the receiving entity, industry standard pseudonym Bob. Clearly she is able now to encrypt messages now and send these to Bob knowing that only Bob alone can decrypt it because only he has an exact copy of the several arrays of her database. The ciphertext functions as a kind of markup language that correctly references the mutual databases but has no encapsulated information by way of keys within itself - it is useless to an adversary who intercepts it - this ploy is part of my very secure cryptpography which is further secured by other means (much more maths later - this here is a management-orientated part topic). It is necessary at the outset of setting up a secure loop between new entities to make a one-off secure delivery of the copy of Alice's database to the new Bob. It is also necessary to expand a large network by other such deliveries to other Bob's and so on. To get to the point the packages of Ada are ideal for these deliveries which may be sent by unsecured email in many cases after the initial contact is made. The construction of a cipher crypto system is very, very manageable by using these packages for their portability and compactness, for on-site scrambling, for slicing of arrays and general all round mmanagement suitability. They can be used as digital signature also if needs be. All of this topic of bears a lot of discussion - this is just a broad outline of what is involved. My instincts at the very outset suggested that all of this would be serviced better by Ada than other programming languages. I was hooked on the package as a system structure in Ada-95 from the word go. Cryptographers have never used this concept before now and instead have resorted to sending secure information by transfroming the plaintext by some mathematically functional method at encryption time and then embedding the transformed form directly into the ciphertext (there for the finding and inverting by some mathematical means by illegal cryptanalysts). I call this encapsulation cryptography (a privately coined word). I compare this cryptography with sending cash through the post instead of a cheque by analogy. I hope this is intelligible to you - adacrypt
From: (see below) on 15 Jun 2010 17:41
On 15/06/2010 22:20, in article c6e6517f-bf79-4708-81f9-2412f7fd314c(a)w31g2000yqb.googlegroups.com, "adacrypt" <austin.obyrne(a)hotmail.com> wrote: > I hope this is intelligible to you - adacrypt It is intelligible enough to make it clear that it is almost entirely irrelevant to question I asked. -- Bill Findlay <surname><forename> chez blueyonder.co.uk |