[Search] |

ABOUT:
[Introduction]POINTERS:
[Texts]## 94A: Communication and information, including encryption |

All of the books in the world contain no more information than is broadcast as video in a single large American city in a single year. Not all bits have equal value.

For number-theoretic aspects of encryption, see number theory (especially 11T71, algebraic coding theory). See also Computer science, (especially 68P25, data encryption).

- 94A05: Communication theory, See also 60G35, 90B12
- 94A08: Image processing (compression, reconstruction, etc.) [See also 68U10] [new in 2000]
- 94A11: Application of orthogonal functions in communication
- 94A12: Signal theory (characterization, reconstruction, etc.)
- 94A13: Detection theory
- 94A14: Modulation and demodulation
- 94A15: Information theory, general, See also 62B10
- 94A17: Measures of information, entropy
- 94A20: Sampling theory [new in 2000]
- 94A24: Coding theorems (Shannon theory)
- 94A29: Source coding
- 94A34: Rate-distortion theory
- 94A40: Channel models
- 94A45: Prefix, length-variable, comma-free codes, See also 20M35, 68Q45
- 94A50: Theory of questionnaires
- 94A55: Shift register sequences
- 94A60: Cryptography, See also 11T71, 68P25
- 94A62: Authentication and secret sharing [new in 2000]
- 94A99: None of the above but in this section

Parent field: 94: Information and communication, circuits

Browse all (old) classifications for this area at the AMS.

De Bruyn, Kristien: "What is information theory?", Bull. Soc. Math. Belg. Sér. B 36 (1984), 215--234. MR86g:94001

Patterson, G. W.: "What is a code?", Comm. ACM 3 1960 315--318. MR25#1071

Neal Koblitz, "A Course in Number Theory and Cryptography", Springer Graduate Texts in Mathematics 114, 1994.

Widman, Kjell-Ove: "Diffie-Hellman and RSA; the layman's guide to public-key cryptography and its applications", Festschrift of Lennart Carleson and Yngve Domar (Uppsala, 1993), 227--248, Acta Univ. Upsaliensis Skr. Uppsala Univ. C Organ. Hist., 58, Uppsala Univ., Uppsala, 1995. MR96d:94006

"Public-key cryptography: state of the art and future directions", Final report of the European Institute for System Security Workshop held in Oberwolfach, July 3--6, 1991. Edited by Th. Beth, M. Frisch and G. J. Simmons. Lecture Notes in Computer Science, 578. Springer-Verlag, Berlin, 1992. 97 pp. ISBN 3-540-55215-4 CMP1230643

Cryptography FAQ's:

- Archives: sci.crypt has been archived since October 1991 on ripem.msu.edu, though these archives are available only to U.S. and Canadian users. Another site is rpub.cl.msu.edu in /pub/crypt/sci.crypt/ from Jan 1992. Please contact crypt-comments@math.ncsu.edu if you know of other archives.
- The sections of this newsgroup's 10-part FAQ are available via anonymous FTP to rtfm.mit.edu as /pub/usenet/news.answers/cryptography-faq/part[xx]. The Cryptography FAQ is posted to the newsgroups sci.crypt, talk.politics.crypto, sci.answers, and news.answers every 21 days.
- RSA Labs' FAQ

There are cryptography newsgroups (sci.crypt and the moderated sci.crypt.research). There are also newsgroups comp.compression and comp.compression.research, and possibly sci.image.processing for data compression discussion.

An online data compression textbook

- How does data compression work?
- Using space-filling curves to compress images.
- Might Peano curves be good for image compression?
- How wavelets developed into tools for image compression (etc.): nice book review by Peter A. McCoy of Yves Meyer's book.
- Applications of fuzzy logic to clustering and image processing
- Applications of 3D (discrete) Fourier transforms to data compression.
- What does factorization have to do with cryptography? (elementary).
- Course notes by Charles Blair for a course in cryptography.
- Table of Contents and introduction to the cryptography FAQ.
- The part of the FAQ discussing the RSA encryption scheme (the one related to factoring).
- Part 1 of RSA, Inc.'s FAQ.
- FAQ for sci.crypt.research
- Cryptanalysis of the WordPerfect document encryption algorithm.
- WordPerfect encryption can be easily defeated -- pointer to decryption program wpcrack (and other miscellaneous tools for cryptanalysis).
- Pointer for trapdoor encryption procedures
- Methods of finding peaks in signal data
- Intersection of regular expressions (and circuit analysis)
- Computing narrow band spectrum noises in signal processing
- Using Savitzky-Golay filter to smooth data
- Comparison of methods for filtering noise from data
- English alphabet -- compare frequency of letter use to encoding (Huffman, Morse, etc.)
- Worst-case code set for a Huffman code generator

Last modified 2000/01/14 by Dave Rusin. Mail: