From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM autolearn=ham autolearn_force=no version=3.4.4 X-Google-Thread: 103376,1e5a2ccbf7bf6d0c,start X-Google-NewGroupId: yes X-Google-Attributes: gida07f3367d7,domainid0,public,usenet X-Google-Language: ENGLISH,CP1252 Path: g2news2.google.com!postnews.google.com!u26g2000yqu.googlegroups.com!not-for-mail From: adacrypt Newsgroups: comp.lang.ada Subject: Ada, Concurrency and Cryptography. Date: Sun, 20 Jun 2010 06:22:27 -0700 (PDT) Organization: http://groups.google.com Message-ID: NNTP-Posting-Host: 109.155.129.244 Mime-Version: 1.0 Content-Type: text/plain; charset=windows-1252 Content-Transfer-Encoding: quoted-printable X-Trace: posting.google.com 1277040147 2154 127.0.0.1 (20 Jun 2010 13:22:27 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: Sun, 20 Jun 2010 13:22:27 +0000 (UTC) Complaints-To: groups-abuse@google.com Injection-Info: u26g2000yqu.googlegroups.com; posting-host=109.155.129.244; posting-account=pmkN8QoAAAAtIhXRUfydb0SCISnwaeyg User-Agent: G2/1.0 X-HTTP-UserAgent: Mozilla/4.0 (compatible; MSIE 7.0; Windows NT 5.1; Trident/4.0; GTB6.5; .NET CLR 1.1.4322; .NET CLR 2.0.50727; .NET CLR 3.0.04506.30; .NET CLR 3.0.4506.2152; .NET CLR 3.5.30729),gzip(gfe) Xref: g2news2.google.com comp.lang.ada:12807 Date: 2010-06-20T06:22:27-07:00 List-Id: I don=92t profess to be very knowledgeable on the finer points of Ada=92s advantages so I will ask my question of more informed people and hopefully get some guidance from some person. In the cryptography that I have invented my encryption program and corresponding decryption program both work in much the same way so its only necessary to describe one in order to ask my question. The encryption program (this will do) reads in a character from an external batch file and encrypts it in between reading the next character in the next pass of the same loop. The program is comprised of a pair of nested loops. The inner loop is terminated by end_of_line and the outer loop is terminated by end_of_file. The encryption speed on an elderly home computer is 15000 characters per second which is ok for this development model but not great for a serious working cipher. I want to speed it up. Question: If the encryption work was done in a separate CPU in another location immediately after the character is read in would this speed up the process very much. Is this proposition feasible i.e a loop that reads in characters only for encryption in a separate CPU elsewhere. Is this an example of concurrency in programming? Is it to be recommended as the best solution to increasing the encryption rate of my ciphers. Your help in answering these questions would be greatly appreciated - adacrypt