2 * Copyright (c) 1989, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
9 * Stan King, John Eldridge, based on algorithm suggested by
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. All advertising materials mentioning features or use of this software
22 * must display the following acknowledgement:
23 * This product includes software developed by the University of
24 * California, Berkeley and its contributors.
25 * 4. Neither the name of the University nor the names of its contributors
26 * may be used to endorse or promote products derived from this software
27 * without specific prior written permission.
29 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
30 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
31 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
32 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
33 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
34 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
35 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
36 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
37 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
38 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
45 static const char copyright[] =
46 "@(#) Copyright (c) 1989, 1993\n\
47 The Regents of the University of California. All rights reserved.\n";
52 static const char sccsid[] = "@(#)caesar.c 8.1 (Berkeley) 5/31/93";
54 static const char rcsid[] =
67 #define LINELENGTH 2048
68 #define ROTATE(ch, perm) \
70 isupper(ch) ? ('A' + (ch - 'A' + perm) % 26) : \
71 islower(ch) ? ('a' + (ch - 'a' + perm) % 26) : ch) : ch
74 * letter frequencies (taken from some unix(tm) documentation)
75 * (unix is a trademark of Bell Laboratories)
78 7.97, 1.35, 3.61, 4.78, 12.37, 2.01, 1.46, 4.49, 6.39, 0.04,
79 0.42, 3.81, 2.69, 5.92, 6.96, 2.91, 0.08, 6.63, 8.77, 9.68,
80 2.62, 0.81, 1.88, 0.23, 2.07, 0.06,
83 void printit __P((char *));
90 int ch, dot, i, nread, winnerdot = 0;
92 int obs[26], try, winner;
94 /* revoke setgid privileges */
100 if (!(inbuf = malloc(LINELENGTH))) {
101 (void)fprintf(stderr, "caesar: out of memory.\n");
105 /* adjust frequency table to weight low probs REAL low */
106 for (i = 0; i < 26; ++i)
107 stdf[i] = log(stdf[i]) + log(26.0 / 100.0);
109 /* zero out observation table */
110 bzero(obs, 26 * sizeof(int));
112 if ((nread = read(STDIN_FILENO, inbuf, LINELENGTH)) < 0) {
113 (void)fprintf(stderr, "caesar: %s\n", strerror(errno));
116 for (i = nread; i--;) {
117 ch = (unsigned char) inbuf[i];
121 else if (isupper(ch))
127 * now "dot" the freqs with the observed letter freqs
128 * and keep track of best fit
130 for (try = winner = 0; try < 26; ++try) { /* += 13) { */
132 for (i = 0; i < 26; i++)
133 dot += obs[i] * stdf[(i + try) % 26];
134 /* initialize winning score */
137 if (dot > winnerdot) {
138 /* got a new winner! */
145 for (i = 0; i < nread; ++i) {
146 ch = (unsigned char) inbuf[i];
147 putchar(ROTATE(ch, winner));
149 if (nread < LINELENGTH)
151 if ((nread = read(STDIN_FILENO, inbuf, LINELENGTH)) < 0) {
152 (void)fprintf(stderr, "caesar: %s\n", strerror(errno));
164 if ((rot = atoi(arg)) < 0) {
165 (void)fprintf(stderr, "caesar: bad rotation value.\n");
168 while ((ch = getchar()) != EOF)
169 putchar(ROTATE(ch, rot));