Ada95 =>ciphertext only attack=>pattern matching...help!!!!

From: Tyler (minuet440_at_hotmail.com)
Date: 11/17/03 

Date: 17 Nov 2003 03:50:35 -0800

hi, i have a problem, im using Ada95 to conduct a ciphertext only
attack, and i want to conduct pattern matching (distance matching?) on
it, i have a dictionary in an array, with a parallel array running
adjacent to it, which contains the number of characters of each word
in the dictionary array (the ciphertext is stored in a string of 7000
characters)...can anyone help me out with an algorithm, checking the
patterns of the dictionary words and matching them with the
ciphertext...? (i have already conducted frequency analysis for single
letters, digraphs & trigraphs) many thanks for taking the time 2 read
this.

ps if u need more info just ask!

Relevant Pages

  • Re: Binary Search
    ... that calls the binary search for finding any matching entry. ... Then that second function looks down the array, as long as it finds matching entries. ... OTOH n is not the range of the whole array, but only the amount of matching elements. ...
    (comp.lang.pascal.delphi.misc)
  • Re: Formal and informal type systems?
    ... >> matching has little to to with grammar based pattern matching of ... I meant argument pattern matching. ... > probably too much of a change to Ada. ... > This avoids the tedious definition of record types for simple pairs. ...
    (comp.lang.ada)
  • Re: indices into an array
    ... My real array is much larger than the example above ... var filteredArray = a.filter( ... At least the for-loop is probably executed in already compiled code then, ... want the matching values, or the matching indexes? ...
    (comp.lang.javascript)
  • Re: Seach and replace tools
    ... matching an array of strings to be found and ... replaing them. ...
    (uk.comp.sys.mac)
  • Re: Seach and replace tools
    ... matching an array of strings to be found and ... replaing them. ...
    (uk.comp.sys.mac)