Kryptologie - Informatik

BEGIN BEGIN { analyse }
FOR FOR F FOR O R i := 1 TO T TO O 26 DO
DO
WITH WITH haeuf[i] DO
DO
BEGIN
BEGIN
buchst := char(i + 64);
anzahl := 0;
END END END; END
max := 0;
FOR F FOR O R i := 1 TO T TO O textLaenge DO
DO
IF IF i MOD MOD MMOD MOD O D periode = rest THEN THEN
THEN
IF IF IIF IF F textVorlage[i] IN I IN N [‚A‘..’Z’, ‚a‘..’z’] THEN
THEN
BEGIN
BEGIN
nr := ord(gross(textVorlage[i])) - 64;
haeuf[nr].anzahl := haeuf[nr].anzahl + 1;
IF I IF F haeuf[nr].anzahl > max THEN
THEN
Max := haeuf[nr].anzahl;
END END END; END
IF IIF IF F (rest = 0) AND A AND N D (periode = 1) THEN
THEN
BEGIN
BEGIN
writeln;
FOR F FOR O R i := 13 TO T TO O 26 DO
DO
BEGIN BEGIN
BEGIN
write(haeuf[i].buchst, ‚ : ‚);
FOR FFOR FOR O R k := 1 TO TTO TO O round(haeuf[i].anzahl / max * buAnzahl) DO
DO
write(‚•‘); writeln;
END END; END
FOR FFOR FOR O R i := 1 TO TO TTO TO O 26 DO DO
DO
BEGIN
BEGIN
write(haeuf[i].buchst, ‚ : ‚);
FOR F FOR O R k := 1 TO T TO O round(haeuf[i].anzahl / max * buAnzahl) DO
DO
write(‚•‘); writeln;
END END; END
writeln;
write(‚Bitte Periodenlänge ablesen:‘);
readln(passwortlaenge); writeln;
END END { IF IIF IF F ( rest = 0 ) }
ELSE
ELSE
BEGIN BEGIN
BEGIN
sortieren;
FOR F FOR O R i := 1 TO T TO O N_VOR DO
DO
BEGIN
BEGIN
v := (25 + ord(haeuf[i].buchst) - ord(meist)) MOD M MOD O D 26 + 1;
vermutung := chr(v + 64);
vorschlag[i] := concat(vorschlag[i], vermutung);
END END; END
END END END; END
END E END N D; { analyse }
BEGIN BEGIN { decodierung }
FOR F FOR O R j := 1 TO TTO TO O N_VOR DO
DO
vorschlag[j] := ‚‘;
analyse(0, 1, ‚E‘);
FOR F FOR O R j := 1 TO TO TTO TO O passwortlaenge - 1 DO
DO
analyse(j, passwortlaenge, ‚E‘);
analyse(0, passwortlaenge, ‚E‘);
FOR F FOR O R j := 1 TO TO TTO TO O N_VOR DO
DO
writeln(j : 1, ‚. Vorschlag Passwort: ‚, vorschlag[j]);
writeln;
write(‚> vermutetes Passwort: ‚);
readln(passwortstr);
decodierung := passwortstr;
END E END N D; { decodierung }
37