1995-09-17 - Re: Newbie Crypto question: MOD?

Header Data

From: tcmay@got.net (Timothy C. May)
To: Childers James <cypherpunks@toad.com
Message Hash: f2a196e32bb28dca5ad1d07bbf540ef17b99e15d41cb4a941783bf3d58187d25
Message ID: <ac80e66d19021004e38b@[205.199.118.202]>
Reply To: N/A
UTC Datetime: 1995-09-17 03:41:15 UTC
Raw Date: Sat, 16 Sep 95 20:41:15 PDT

Raw message

From: tcmay@got.net (Timothy C. May)
Date: Sat, 16 Sep 95 20:41:15 PDT
To: Childers James <cypherpunks@toad.com
Subject: Re: Newbie Crypto question: MOD?
Message-ID: <ac80e66d19021004e38b@[205.199.118.202]>
MIME-Version: 1.0
Content-Type: text/plain


At 8:39 PM 9/16/95, Childers James wrote:
>Ok folks, I recently received "Applied Cryptography" as a gift, and just
>have one question: How does the MOD function work in crypto functions? It
>seems to work differently than what I've seen before, i.e.: C/C++ MOD. I
>also didn't see anything in TCM's FAQ...
>
>If this is considered noise, I apologize in advance.

I didn't put anything in my FAQ about "mod" because my FAQ was not a crypto
FAQ per se, of which there are at least two. (Cf. sci.crypt for regular
pointers.)

And I doubt that either of these FAQs discusses the mod function, though I
haven't checked.

In any case, Schneier devotes several pages to mod, starting with "You all
learned modular arithmetic in school; it was called "clock arithmetic"" (p.
198).

After defining it, Schneier goes on to discuss its use in modern cryptography.

If this isn't enough of an explanation, I don't know what more to say.

--Tim May

---------:---------:---------:---------:---------:---------:---------:----
Timothy C. May              | Crypto Anarchy: encryption, digital money,
tcmay@got.net  408-728-0152 | anonymous networks, digital pseudonyms, zero
Corralitos, CA              | knowledge, reputations, information markets,
Higher Power: 2^756839      | black markets, collapse of governments.
"National borders are just speed bumps on the information superhighway."







Thread