Article View: sci.crypt
Article #4314Re: New(?) encryption algorithm
From: Hal Feinstein
Date: Tue, 06 Mar 1990 21:32
Date: Tue, 06 Mar 1990 21:32
16 lines
1269 bytes
1269 bytes
This is kind of a silly question. I recently sat through a college level course on telecommunications security that had a lot of elementary code breaking stuff in it. Of all the subjects to get hung up on, someone in the class asked if in counting 2-grams (bigrams) you shoud count every pair of letters or to tally each pair by sliding a pointer down one character at a time and taking the character pointed to and the one to its immediate right as a pair. Well, the class divided. The heck with traffic analysis and clandestine intercept, this was really important! Since then, blackboards have been filled with math and the college halls filled with people shouting themselves hoarse over this, the great bigram affair. Really! Now, I put it to you in networld: which is the "correct" way to count bigrams?
Technical Details
Message-ID:
<100295@linus.UUCP>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!samsung!think!linus!gateway.mitre.org!halReferences:
<1877@bruce.OZ>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!samsung!think!linus!gateway.mitre.org!hal From: hal@gateway.mitre.org (Hal Feinstein) Newsgroups: sci.crypt,comp.lang.c Subject: Re: New(?) encryption algorithm Message-ID: <100295@linus.UUCP> Date: 6 Mar 90 21:32:22 GMT References: <1877@bruce.OZ> Sender: news@linus.UUCP Reply-To: hal@gateway.mitre.org (Hal Feinstein) Organization: The Mitre Corporation Lines: 16