BREAKING SUBSTITUTION CIPHERS USING A RELAXATION ALGORITHM

被引：38

作者：

PELEG, S

ROSENFELD, A

机构：

[1] University of Maryland, Computer Science Center, College Park

来源：

COMMUNICATIONS OF THE ACM | 1979年 / 22卷 / 11期

关键词：

cryptography; probabilistic classification; relaxation; substitution ciphers;

D O I：

10.1145/359168.359174

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Substitution ciphers are codes in which each letter of the alphabet has one fixed substitute, and the word divisions do not change. In this paper the problem of breaking substitution ciphers is represented as a probabilistic labeling problem. Every code letter is assigned probabilities of representing plaintext letters. These probabilities are updated in parallel for all code letters, using joint letter probabilities. Iterating the updating scheme results in improved estimates that finally lead to breaking the cipher. The method is applied successfully to two examples. © 1979, ACM. All rights reserved.

引用

页码：598 / 605

页数：8

共 7 条

[1]

Gaines HF., 1956, CRYPTANALYSIS

[2]

KIRBY R, UNPUBLISHED

[3]

PELEG S, 1978, IEEE T SYST MAN CYB, V8, P548

[4] AMBIGUITY REDUCTION IN HANDWRITING WITH AMBIGUOUS SEGMENTATION AND UNCERTAIN INTERPRETATION [J].

PELEG, S .

COMPUTER GRAPHICS AND IMAGE PROCESSING, 1979, 10 (03) :235-245

[5]

PELEG S, 1979, AUG P IEEE C PATT RE, P337

[6] SCENE LABELING BY RELAXATION OPERATIONS [J].

ROSENFELD, A ;

HUMMEL, RA ;

ZUCKER, SW .

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1976, 6 (06) :420-433

[7]

Sinkov A., 1968, ELEMENTARY CRYPTANAL

← 1 →