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=unavailable autolearn_force=no version=3.4.4 X-Received: by 10.129.168.130 with SMTP id f124mr6949411ywh.148.1493453625355; Sat, 29 Apr 2017 01:13:45 -0700 (PDT) X-Received: by 10.157.31.68 with SMTP id x4mr308787otx.19.1493453625291; Sat, 29 Apr 2017 01:13:45 -0700 (PDT) Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!news.eternal-september.org!feeder.eternal-september.org!news.glorb.com!c45no482906qtb.1!news-out.google.com!v18ni2794ita.0!nntp.google.com!c26no760056itd.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Sat, 29 Apr 2017 01:13:45 -0700 (PDT) Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=81.147.126.216; posting-account=pmkN8QoAAAAtIhXRUfydb0SCISnwaeyg NNTP-Posting-Host: 81.147.126.216 User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: <7edc0e62-80fe-4a91-9015-69c781207fc8@googlegroups.com> Subject: Tasking and Concurrent Programming Using Multiple Ada Programs. From: Austin Obyrne Injection-Date: Sat, 29 Apr 2017 08:13:45 +0000 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: quoted-printable Xref: news.eternal-september.org comp.lang.ada:46642 Date: 2017-04-29T01:13:45-07:00 List-Id: I have come over from sci crypt group to ask your advice on an encryption c= oncept. The concept is a design plan to use a possible 36 ciphers (varian= ts of the same basic cipoher and compatible to each other)in an Ada tasking= program.=20 The hoped for plan is to write a program that will cater for 36 (or less if= needs be ) ciphers all reading in and immediately encrypting, in rotation = from the same file of plaintext and writing out the resulting ciphertext to= the same ciphertext file (the encrypted plaintext file). They would of co= urse be written in Ada. What I would like to know is if some of your members are familiar with task= ing and concurrent programming sufficient to be able to say - Yes, it is fe= asible at least and give any other advice you may have to offer. Thanking you in anticipation of your usual support. adacrypt =20