Changeset 8426


Ignore:
Timestamp:
Oct 21, 2019, 11:13:16 AM (2 years ago)
Author:
Christian Bender
Message:

DCA components: Typos and translations

Location:
trunk/CrypPlugins
Files:
8 edited

Legend:

Unmodified
Added
Removed
  • trunk/CrypPlugins/DCAKeyRecovery/Properties/Resources.Designer.cs

    r8425 r8426  
    737737       
    738738        /// <summary>
    739         ///   Sucht eine lokalisierte Zeichenfolge, die Restored round key K0: ähnelt.
     739        ///   Sucht eine lokalisierte Zeichenfolge, die Restored round key k0: ähnelt.
    740740        /// </summary>
    741741        internal static string SummaryResultViewRecoveredK0 {
     
    746746       
    747747        /// <summary>
    748         ///   Sucht eine lokalisierte Zeichenfolge, die Restored round key K1: ähnelt.
     748        ///   Sucht eine lokalisierte Zeichenfolge, die Restored round key k1: ähnelt.
    749749        /// </summary>
    750750        internal static string SummaryResultViewRecoveredK1 {
     
    755755       
    756756        /// <summary>
    757         ///   Sucht eine lokalisierte Zeichenfolge, die Restored round key K2: ähnelt.
     757        ///   Sucht eine lokalisierte Zeichenfolge, die Restored round key k2: ähnelt.
    758758        /// </summary>
    759759        internal static string SummaryResultViewRecoveredK2 {
     
    764764       
    765765        /// <summary>
    766         ///   Sucht eine lokalisierte Zeichenfolge, die Restored round key K3: ähnelt.
     766        ///   Sucht eine lokalisierte Zeichenfolge, die Restored round key k3: ähnelt.
    767767        /// </summary>
    768768        internal static string SummaryResultViewRecoveredK3 {
     
    773773       
    774774        /// <summary>
    775         ///   Sucht eine lokalisierte Zeichenfolge, die Restored round key K4: ähnelt.
     775        ///   Sucht eine lokalisierte Zeichenfolge, die Restored round key k4: ähnelt.
    776776        /// </summary>
    777777        internal static string SummaryResultViewRecoveredK4 {
     
    782782       
    783783        /// <summary>
    784         ///   Sucht eine lokalisierte Zeichenfolge, die Restored round key K5: ähnelt.
     784        ///   Sucht eine lokalisierte Zeichenfolge, die Restored round key k5: ähnelt.
    785785        /// </summary>
    786786        internal static string SummaryResultViewRecoveredK5 {
  • trunk/CrypPlugins/DCAKeyRecovery/Properties/Resources.resx

    r8425 r8426  
    344344  </data>
    345345  <data name="SummaryResultViewRecoveredK0" xml:space="preserve">
    346     <value>Restored round key K0:</value>
     346    <value>Restored round key k0:</value>
    347347  </data>
    348348  <data name="SummaryResultViewRecoveredK1" xml:space="preserve">
    349     <value>Restored round key K1:</value>
     349    <value>Restored round key k1:</value>
    350350  </data>
    351351  <data name="SummaryResultViewRecoveredK2" xml:space="preserve">
    352     <value>Restored round key K2:</value>
     352    <value>Restored round key k2:</value>
    353353  </data>
    354354  <data name="SummaryResultViewRecoveredK3" xml:space="preserve">
    355     <value>Restored round key K3:</value>
     355    <value>Restored round key k3:</value>
    356356  </data>
    357357  <data name="SummaryResultViewRecoveredK4" xml:space="preserve">
    358     <value>Restored round key K4:</value>
     358    <value>Restored round key k4:</value>
    359359  </data>
    360360  <data name="SummaryResultViewRecoveredK5" xml:space="preserve">
    361     <value>Restored round key K5:</value>
     361    <value>Restored round key k5:</value>
    362362  </data>
    363363  <data name="SummaryResultViewStartTime" xml:space="preserve">
  • trunk/CrypPlugins/DCAPathFinder/Properties/Resources.Designer.cs

    r8422 r8426  
    611611       
    612612        /// <summary>
    613         ///   Sucht eine lokalisierte Zeichenfolge, die Welcome to the differential cryptanalysis (dca) tutorial. This method for the analysis of turn-based symmetric block ciphers aims at recovering single bits up to complete round keys. This procedure was published in 1991 by the two Israeli researchers Eli Biham and Adi Shamir. ähnelt.
     613        ///   Sucht eine lokalisierte Zeichenfolge, die Welcome to the differential cryptanalysis (DCA) tutorial. This method for the analysis of turn-based symmetric block ciphers aims at recovering single bits up to complete round keys. This procedure was published in 1991 by the two Israeli researchers Eli Biham and Adi Shamir. ähnelt.
    614614        /// </summary>
    615615        public static string OverviewContent1 {
     
    620620       
    621621        /// <summary>
    622         ///   Sucht eine lokalisierte Zeichenfolge, die This tutorial covers the dca in three parts. Part 1 conveys the basic idea of the dca by means of a cipher with an encryption round. Part 2 deepens this idea using a cipher with three encryption rounds. Part 3 deepens the knowledge by increasing the complexity of the cipher to five encryption rounds. ähnelt.
     622        ///   Sucht eine lokalisierte Zeichenfolge, die This tutorial covers the DCA in three parts. Part 1 conveys the basic idea of the DCA by means of a cipher with an encryption round. Part 2 deepens this idea using a cipher with three encryption rounds. Part 3 deepens the knowledge by increasing the complexity of the cipher to five encryption rounds. ähnelt.
    623623        /// </summary>
    624624        public static string OverviewContent2 {
     
    818818       
    819819        /// <summary>
    820         ///   Sucht eine lokalisierte Zeichenfolge, die Attacked S boxes: ähnelt.
     820        ///   Sucht eine lokalisierte Zeichenfolge, die Attacked S-boxes: ähnelt.
    821821        /// </summary>
    822822        public static string SBoxes {
     
    827827       
    828828        /// <summary>
    829         ///   Sucht eine lokalisierte Zeichenfolge, die At least one S box must be marked to continue the attack. ähnelt.
     829        ///   Sucht eine lokalisierte Zeichenfolge, die At least one S-box must be marked to continue the attack. ähnelt.
    830830        /// </summary>
    831831        public static string SBoxWarning {
     
    908908       
    909909        /// <summary>
    910         ///   Sucht eine lokalisierte Zeichenfolge, die tutorial {0} ähnelt.
     910        ///   Sucht eine lokalisierte Zeichenfolge, die Tutorial {0} ähnelt.
    911911        /// </summary>
    912912        public static string StartMaskContent2Run2 {
     
    11331133       
    11341134        /// <summary>
    1135         ///   Sucht eine lokalisierte Zeichenfolge, die Here we apply the idea of the dca to Chiffre 1. The structure of a cipher is usually public, so that all components and their functionality are known. The security of a cipher should never be based on the secrecy of the construction, but on the secrecy of the key. This requirement is also called Kerckhoff&apos;s principle. ähnelt.
     1135        ///   Sucht eine lokalisierte Zeichenfolge, die Here we apply the idea of the DCA to Chiffre 1. The structure of a cipher is usually public, so that all components and their functionality are known. The security of a cipher should never be based on the secrecy of the construction, but on the secrecy of the key. This requirement is also called Kerckhoff&apos;s principle. ähnelt.
    11361136        /// </summary>
    11371137        public static string Tutorial1DifferentialCryptanalysisSlide1Content1 {
     
    12141214       
    12151215        /// <summary>
    1216         ///   Sucht eine lokalisierte Zeichenfolge, die The intermediate result u is then substituted by the S boxes: ähnelt.
     1216        ///   Sucht eine lokalisierte Zeichenfolge, die The intermediate result u is then substituted by the S-boxes: ähnelt.
    12171217        /// </summary>
    12181218        public static string Tutorial1DifferentialCryptanalysisSlide1Content3 {
     
    19161916       
    19171917        /// <summary>
    1918         ///   Sucht eine lokalisierte Zeichenfolge, die We obtain the difference of the plaintexts by calculating the difference of the ciphertexts. This can be used to obtain information about the round keys at dca. ähnelt.
     1918        ///   Sucht eine lokalisierte Zeichenfolge, die We obtain the difference of the plaintexts by calculating the difference of the ciphertexts. This can be used to obtain information about the round keys at DCA. ähnelt.
    19191919        /// </summary>
    19201920        public static string Tutorial1IntroductionSlide3Content3 {
     
    19341934       
    19351935        /// <summary>
    1936         ///   Sucht eine lokalisierte Zeichenfolge, die The dca is now continued in the DCA KeyRecovery component. ähnelt.
     1936        ///   Sucht eine lokalisierte Zeichenfolge, die The DCA is now continued in the DCA KeyRecovery component. ähnelt.
    19371937        /// </summary>
    19381938        public static string Tutorial1LastSlideContent1 {
     
    20332033       
    20342034        /// <summary>
    2035         ///   Sucht eine lokalisierte Zeichenfolge, die In the dca against cipher 1, the round keys k ähnelt.
     2035        ///   Sucht eine lokalisierte Zeichenfolge, die In the DCA against cipher 1, the round keys k ähnelt.
    20362036        /// </summary>
    20372037        public static string Tutorial1PracticalDifferentialCryptanalysisSlide1Content1Run1 {
     
    21232123       
    21242124        /// <summary>
    2125         ///   Sucht eine lokalisierte Zeichenfolge, die 3. Analysis of the S boxes ähnelt.
     2125        ///   Sucht eine lokalisierte Zeichenfolge, die 3. Analysis of the S-boxes ähnelt.
    21262126        /// </summary>
    21272127        public static string Tutorial2AnalysisOfSBoxHeader {
     
    21322132       
    21332133        /// <summary>
    2134         ///   Sucht eine lokalisierte Zeichenfolge, die Due to the key addition, the S box behaves non-linear. A guess attempt for K3 cannot be checked directly. ähnelt.
     2134        ///   Sucht eine lokalisierte Zeichenfolge, die Due to the key addition, the S-box behaves non-linear. A guess attempt for k3 cannot be checked directly. ähnelt.
    21352135        /// </summary>
    21362136        public static string Tutorial2AnalysisOfSBoxSlide1Content1 {
     
    21412141       
    21422142        /// <summary>
    2143         ///   Sucht eine lokalisierte Zeichenfolge, die All S boxes of cipher 2 behave identically. For this reason it is sufficient to analyze the functionality of a single S box. Basically it is possible to consider 4 parallel S boxes as one big S box, but this would increase the analysis effort. The S box receives 4 bits as input and also outputs 4 bits as output. The 4 input bits are replaced by 4 other output bits. ähnelt.
     2143        ///   Sucht eine lokalisierte Zeichenfolge, die All S-boxes of cipher 2 behave identically. For this reason it is sufficient to analyze the functionality of a single S-box. Basically it is possible to consider 4 parallel S-boxes as one big S-box, but this would increase the analysis effort. The S-box receives 4 bits as input and also outputs 4 bits as output. The 4 input bits are replaced by 4 other output bits. ähnelt.
    21442144        /// </summary>
    21452145        public static string Tutorial2AnalysisOfSBoxSlide1Content2 {
     
    21502150       
    21512151        /// <summary>
    2152         ///   Sucht eine lokalisierte Zeichenfolge, die Remember: Differential cryptanalysis works with differences of messages. In order to examine the S box, all combinations of input plaintext are considered and their differences are formed. For each pair, the plaintexts are entered individually into the S box and then the difference of the substituted outputs is calculated. The transitions from input to output difference are noted. ähnelt.
     2152        ///   Sucht eine lokalisierte Zeichenfolge, die Remember: Differential cryptanalysis works with differences of messages. In order to examine the S-box, all combinations of input plaintext are considered and their differences are formed. For each pair, the plaintexts are entered individually into the S-box and then the difference of the substituted outputs is calculated. The transitions from input to output difference are noted. ähnelt.
    21532153        /// </summary>
    21542154        public static string Tutorial2AnalysisOfSBoxSlide1Content3 {
     
    21772177       
    21782178        /// <summary>
    2179         ///   Sucht eine lokalisierte Zeichenfolge, die Analysis of the S boxes ähnelt.
     2179        ///   Sucht eine lokalisierte Zeichenfolge, die Analysis of the S-boxes ähnelt.
    21802180        /// </summary>
    21812181        public static string Tutorial2AnalysisOfSBoxSlide1Header {
     
    21952195       
    21962196        /// <summary>
    2197         ///   Sucht eine lokalisierte Zeichenfolge, die Analysis of the S boxes ähnelt.
     2197        ///   Sucht eine lokalisierte Zeichenfolge, die Analysis of the S-boxes ähnelt.
    21982198        /// </summary>
    21992199        public static string Tutorial2AnalysisOfSBoxSlide2Header {
     
    22222222       
    22232223        /// <summary>
    2224         ///   Sucht eine lokalisierte Zeichenfolge, die The input and output differences and the entries of the difference distribution table are hexadecimal. ähnelt.
     2224        ///   Sucht eine lokalisierte Zeichenfolge, die The input and output differences and the entries of the difference distribution table are displayed in hexadecimal format. ähnelt.
    22252225        /// </summary>
    22262226        public static string Tutorial2AnalysisOfSBoxSlide3Content1 {
     
    22312231       
    22322232        /// <summary>
    2233         ///   Sucht eine lokalisierte Zeichenfolge, die A 4 bit S box has 16 different inputs and 16 different outputs. If 2 messages are combined to a message pair with disjoint differences, 256 different transitions of differences can be observed. ähnelt.
     2233        ///   Sucht eine lokalisierte Zeichenfolge, die A 4 bit S-box has 16 different inputs and 16 different outputs. If 2 messages are combined to a message pair with disjoint differences, 256 different transitions of differences can be observed. ähnelt.
    22342234        /// </summary>
    22352235        public static string Tutorial2AnalysisOfSBoxSlide3Content2 {
     
    22492249       
    22502250        /// <summary>
    2251         ///   Sucht eine lokalisierte Zeichenfolge, die The distribution of differences is obviously not equally distributed. In practice, S boxes are not perfect. The cryptanalyst makes use of this fact. Particularly high probabilities help with differential cryptanalysis. ähnelt.
     2251        ///   Sucht eine lokalisierte Zeichenfolge, die The distribution of differences is obviously not equally distributed. In practice, S-boxes are not perfect. The cryptanalyst makes use of this fact. Particularly high probabilities help with differential cryptanalysis. ähnelt.
    22522252        /// </summary>
    22532253        public static string Tutorial2AnalysisOfSBoxSlide3Content4 {
     
    22582258       
    22592259        /// <summary>
    2260         ///   Sucht eine lokalisierte Zeichenfolge, die Analysis of the S boxes ähnelt.
     2260        ///   Sucht eine lokalisierte Zeichenfolge, die Analysis of the S-boxes ähnelt.
    22612261        /// </summary>
    22622262        public static string Tutorial2AnalysisOfSBoxSlide3Header {
     
    22762276       
    22772277        /// <summary>
    2278         ///   Sucht eine lokalisierte Zeichenfolge, die In the following, the encryption of a plain text block is shown schematically. As in tutorial 1, the internal states during the encryption process are described with variables u and v. The following table shows the encryption of a plain text block. ähnelt.
     2278        ///   Sucht eine lokalisierte Zeichenfolge, die In the following, the encryption of a plain text block is shown schematically. As in Tutorial 1, the internal states during the encryption process are described with variables u and v. The following table shows the encryption of a plaintext block. ähnelt.
    22792279        /// </summary>
    22802280        public static string Tutorial2AnalysisSlide1Content2 {
     
    23122312       
    23132313        /// <summary>
    2314         ///   Sucht eine lokalisierte Zeichenfolge, die One could now try to get the key k ähnelt.
     2314        ///   Sucht eine lokalisierte Zeichenfolge, die You could now try to get the key k ähnelt.
    23152315        /// </summary>
    23162316        public static string Tutorial2AnalysisSlide3Content1Run1 {
     
    23302330       
    23312331        /// <summary>
    2332         ///   Sucht eine lokalisierte Zeichenfolge, die . With the plaintexts one is still able to calculate the difference of the u ähnelt.
     2332        ///   Sucht eine lokalisierte Zeichenfolge, die . With the plaintexts you are still able to calculate the difference of the u ähnelt.
    23332333        /// </summary>
    23342334        public static string Tutorial2AnalysisSlide3Content1Run11 {
     
    23662366       
    23672367        /// <summary>
    2368         ///   Sucht eine lokalisierte Zeichenfolge, die  in a similar way to cipher 1. For this you would have a pair of plaintext and their corresponding secret texts available. Then you would guess a possible round key t to calculate the internal variables v ähnelt.
     2368        ///   Sucht eine lokalisierte Zeichenfolge, die  in a similar way to cipher 1. To do so, you would use a pair of plaintext and their corresponding ciphertexts. Then you would guess a possible round key t to calculate the internal variables v ähnelt.
    23692369        /// </summary>
    23702370        public static string Tutorial2AnalysisSlide3Content1Run3 {
     
    24202420       
    24212421        /// <summary>
    2422         ///   Sucht eine lokalisierte Zeichenfolge, die  is also unknown, one could now calculate the difference of u ähnelt.
     2422        ///   Sucht eine lokalisierte Zeichenfolge, die  is also unknown, you could now calculate the difference of u ähnelt.
    24232423        /// </summary>
    24242424        public static string Tutorial2AnalysisSlide3Content1Run9 {
     
    24292429       
    24302430        /// <summary>
    2431         ///   Sucht eine lokalisierte Zeichenfolge, die Due to the Exclusive-Or, the S box behaves non-linear, so that the difference of the v ähnelt.
     2431        ///   Sucht eine lokalisierte Zeichenfolge, die Due to the Exclusive-Or, the S-box behaves non-linear, so that the difference of the v ähnelt.
    24322432        /// </summary>
    24332433        public static string Tutorial2AnalysisSlide3Content2Run1 {
     
    24742474       
    24752475        /// <summary>
    2476         ///   Sucht eine lokalisierte Zeichenfolge, die To solve this problem, lets take a closer look at how the S boxes work. ähnelt.
     2476        ///   Sucht eine lokalisierte Zeichenfolge, die To solve this problem, lets take a closer look at how the S-boxes work. ähnelt.
    24772477        /// </summary>
    24782478        public static string Tutorial2AnalysisSlide3Content3 {
     
    26002600       
    26012601        /// <summary>
    2602         ///   Sucht eine lokalisierte Zeichenfolge, die By clicking on continue, the first two round keys k ähnelt.
     2602        ///   Sucht eine lokalisierte Zeichenfolge, die By clicking on &quot;Continue&quot;, the first two round keys k ähnelt.
    26032603        /// </summary>
    26042604        public static string Tutorial2AttackFirstRoundContent2Run1 {
     
    27082708       
    27092709        /// <summary>
    2710         ///   Sucht eine lokalisierte Zeichenfolge, die  is to be attacked. S boxes can be selected for this in the second encryption round.  By selecting an S box, the respective 4 bits of the round key are attacked and an attempt is made to restore them. ähnelt.
     2710        ///   Sucht eine lokalisierte Zeichenfolge, die  is to be attacked. S-boxes can be selected for this in the second encryption round.  By selecting an S-box, the respective 4 bits of the round key are attacked and an attempt is made to restore them. ähnelt.
    27112711        /// </summary>
    27122712        public static string Tutorial2AttackKeyRound2Content1Run3 {
     
    27622762       
    27632763        /// <summary>
    2764         ///   Sucht eine lokalisierte Zeichenfolge, die  of the cipher will be attacked. S boxes can be selected for this in the third encryption round. By selecting an Sbox the respective 4 bits of the round key are attacked and an attempt is made to restore them. ähnelt.
     2764        ///   Sucht eine lokalisierte Zeichenfolge, die  of the cipher will be attacked. S-boxes can be selected for this in the third encryption round. By selecting an S-box the respective 4 bits of the round key are attacked and an attempt is made to restore them. ähnelt.
    27652765        /// </summary>
    27662766        public static string Tutorial2AttackKeyRound3Content1Run3 {
     
    27712771       
    27722772        /// <summary>
    2773         ///   Sucht eine lokalisierte Zeichenfolge, die In differential cryptanalysis, the change of differences at the S boxes is considered. S boxes should therefore be selected at this point. ähnelt.
     2773        ///   Sucht eine lokalisierte Zeichenfolge, die In differential cryptanalysis, the change of differences at the S-boxes is considered. S-boxes should therefore be selected at this point. ähnelt.
    27742774        /// </summary>
    27752775        public static string Tutorial2AttackKeyRound3Content1Run4 {
     
    27802780       
    27812781        /// <summary>
    2782         ///   Sucht eine lokalisierte Zeichenfolge, die The more key bits that are selected, the more complicated the search for a differential. However, it can make sense to attack several S boxes at the same time. Depending on the nature of the cipher, better or worse differentials can be found. ähnelt.
     2782        ///   Sucht eine lokalisierte Zeichenfolge, die The more key bits that are selected, the more complicated the search for a differential. However, it can make sense to attack several S-boxes at the same time. Depending on the nature of the cipher, better or worse differentials can be found. ähnelt.
    27832783        /// </summary>
    27842784        public static string Tutorial2AttackKeyRound3Content1Run5 {
     
    27892789       
    27902790        /// <summary>
    2791         ///   Sucht eine lokalisierte Zeichenfolge, die Select S boxes from round 2 to get key bits from k ähnelt.
     2791        ///   Sucht eine lokalisierte Zeichenfolge, die Select S-boxes from round 2 to get key bits from k ähnelt.
    27922792        /// </summary>
    27932793        public static string Tutorial2AttackRound2HeaderRun1 {
     
    28162816       
    28172817        /// <summary>
    2818         ///   Sucht eine lokalisierte Zeichenfolge, die Select S boxes from round 3 to get key bits from k ähnelt.
     2818        ///   Sucht eine lokalisierte Zeichenfolge, die Select S-boxes from round 3 to get key bits from k ähnelt.
    28192819        /// </summary>
    28202820        public static string Tutorial2AttackRound3HeaderRun1 {
     
    28612861       
    28622862        /// <summary>
    2863         ///   Sucht eine lokalisierte Zeichenfolge, die  are substituted using the S box by a pair of outputs differing by a difference  ähnelt.
     2863        ///   Sucht eine lokalisierte Zeichenfolge, die  are substituted using the S-box by a pair of outputs differing by a difference  ähnelt.
    28642864        /// </summary>
    28652865        public static string Tutorial2CharacteristicSlide1Content1Run2 {
     
    28992899       
    29002900        /// <summary>
    2901         ///   Sucht eine lokalisierte Zeichenfolge, die  a differential characteristic under the operation of the S box. As seen before, a differential characteristic has a fixed probability. ähnelt.
     2901        ///   Sucht eine lokalisierte Zeichenfolge, die  a differential characteristic under the operation of the S-box. As seen before, a differential characteristic has a fixed probability. ähnelt.
    29022902        /// </summary>
    29032903        public static string Tutorial2CharacteristicSlide1Content2Run2 {
     
    29262926       
    29272927        /// <summary>
    2928         ///   Sucht eine lokalisierte Zeichenfolge, die An encryption round for cipher 2 consists of key addition, substitution and permutation. The cipher works on 16 bit blocks. The previous notation is extended as follows to denote a differential characteristic of an S box for 16 bit blocks ähnelt.
     2928        ///   Sucht eine lokalisierte Zeichenfolge, die An encryption round for cipher 2 consists of key addition, substitution and permutation. The cipher works on 16 bit blocks. The previous notation is extended as follows to denote a differential characteristic of an S-box for 16 bit blocks ähnelt.
    29292929        /// </summary>
    29302930        public static string Tutorial2CharacteristicSlide2Content1 {
     
    29892989       
    29902990        /// <summary>
    2991         ///   Sucht eine lokalisierte Zeichenfolge, die In the first 4-tuple the input differences of the S boxes of the first 4 S boxes are given in the first encryption round. In the second 4-tuple, both the output difference of the first and the input difference of the second encryption round are noted. In the 3rd 4-tuple, the output difference of the second and the input difference of the last encryption round are noted. ähnelt.
     2991        ///   Sucht eine lokalisierte Zeichenfolge, die In the first 4-tuple the input differences of the S-boxes of the first 4 S-boxes are given in the first encryption round. In the second 4-tuple, both the output difference of the first and the input difference of the second encryption round are noted. In the 3rd 4-tuple, the output difference of the second and the input difference of the last encryption round are noted. ähnelt.
    29922992        /// </summary>
    29932993        public static string Tutorial2CharacteristicSlide3Content4 {
     
    30703070       
    30713071        /// <summary>
    3072         ///   Sucht eine lokalisierte Zeichenfolge, die In tutorial 1 the idea of differential cryptanalysis was introduced and demonstrated with a cipher consisting of one encryption round with two round keys. ähnelt.
     3072        ///   Sucht eine lokalisierte Zeichenfolge, die In Tutorial 1 the idea of differential cryptanalysis was introduced and demonstrated with a cipher consisting of one encryption round with two round keys. ähnelt.
    30733073        /// </summary>
    30743074        public static string Tutorial2IntroductionSlide1Content1 {
     
    31243124       
    31253125        /// <summary>
    3126         ///   Sucht eine lokalisierte Zeichenfolge, die Once a differential has been found with a high probability, key bits can be recovered. For this purpose, the S boxes are considered where the expected difference is different from 0. ähnelt.
     3126        ///   Sucht eine lokalisierte Zeichenfolge, die Once a differential has been found with a high probability, key bits can be recovered. For this purpose, the S-boxes are considered where the expected difference is different from 0. ähnelt.
    31273127        /// </summary>
    31283128        public static string Tutorial2RecoverKeyInformationSlide1Content1 {
     
    40964096       
    40974097        /// <summary>
    4098         ///   Sucht eine lokalisierte Zeichenfolge, die Sie können nun in der DKA-KeyRecovery-Komponente die in der DKA-PfadFinder-Komponente generierte Angriffskonfiguration verwenden, um Schlüsselbits wiederherzustellen. Dazu müssen Sie auf den Start-Button klicken. ähnelt.
     4098        ///   Sucht eine lokalisierte Zeichenfolge, die Sie können nun in der DKA-KeyRecovery-Komponente die in der DKA-PfadFinder-Komponente generierte Angriffskonfiguration verwenden, um Schlüsselbits wiederherzustellen. Dazu müssen Sie auf den Button &quot;Start&quot; klicken. ähnelt.
    40994099        /// </summary>
    41004100        public static string Tutorial3WaitingSlideContent1 {
  • trunk/CrypPlugins/DCAPathFinder/Properties/Resources.de.resx

    r8416 r8426  
    791791  </data>
    792792  <data name="Tutorial2WaitingSlideContent1" xml:space="preserve">
    793     <value>Sie können nun in der DKA-KeyRecovery-Komponente die in der DKA-PfadFinder-Komponente generierte Angriffskonfiguration verwenden, um Schlüsselbits wiederherzustellen. Dazu müssen Sie auf den Start-Button klicken.</value>
     793    <value>Sie können nun in der DKA-KeyRecovery-Komponente die in der DKA-PfadFinder-Komponente generierte Angriffskonfiguration verwenden, um Schlüsselbits wiederherzustellen. Dazu müssen Sie auf den Button "Start" klicken.</value>
    794794  </data>
    795795  <data name="Tutorial2WaitingSlideContent2" xml:space="preserve">
     
    875875  </data>
    876876  <data name="Tutorial3WaitingSlideContent1" xml:space="preserve">
    877     <value>Sie können nun in der DKA-KeyRecovery-Komponente die in der DKA-PfadFinder-Komponente generierte Angriffskonfiguration verwenden, um Schlüsselbits wiederherzustellen. Dazu müssen Sie auf den Start-Button klicken.</value>
     877    <value>Sie können nun in der DKA-KeyRecovery-Komponente die in der DKA-PfadFinder-Komponente generierte Angriffskonfiguration verwenden, um Schlüsselbits wiederherzustellen. Dazu müssen Sie auf den Button "Start" klicken.</value>
    878878  </data>
    879879  <data name="Tutorial3WaitingSlideContent2" xml:space="preserve">
  • trunk/CrypPlugins/DCAPathFinder/Properties/Resources.resx

    r8422 r8426  
    371371  </data>
    372372  <data name="SBoxes" xml:space="preserve">
    373     <value>Attacked S boxes:</value>
     373    <value>Attacked S-boxes:</value>
    374374  </data>
    375375  <data name="SBoxWarning" xml:space="preserve">
    376     <value>At least one S box must be marked to continue the attack.</value>
     376    <value>At least one S-box must be marked to continue the attack.</value>
    377377  </data>
    378378  <data name="SearchConfiguration" xml:space="preserve">
     
    401401  </data>
    402402  <data name="StartMaskContent2Run2" xml:space="preserve">
    403     <value>tutorial {0}</value>
     403    <value>Tutorial {0}</value>
    404404  </data>
    405405  <data name="StartMaskContent2Run3" xml:space="preserve">
     
    503503  </data>
    504504  <data name="Tutorial1DifferentialCryptanalysisSlide1Content3" xml:space="preserve">
    505     <value>The intermediate result u is then substituted by the S boxes:</value>
     505    <value>The intermediate result u is then substituted by the S-boxes:</value>
    506506  </data>
    507507  <data name="Tutorial1DifferentialCryptanalysisSlide1Header" xml:space="preserve">
     
    806806  </data>
    807807  <data name="Tutorial2AnalysisOfSBoxHeader" xml:space="preserve">
    808     <value>3. Analysis of the S boxes</value>
     808    <value>3. Analysis of the S-boxes</value>
    809809  </data>
    810810  <data name="Tutorial2AnalysisOfSBoxSlide1Content1" xml:space="preserve">
    811     <value>Due to the key addition, the S box behaves non-linear. A guess attempt for K3 cannot be checked directly.</value>
     811    <value>Due to the key addition, the S-box behaves non-linear. A guess attempt for k3 cannot be checked directly.</value>
    812812  </data>
    813813  <data name="Tutorial2AnalysisOfSBoxSlide1Content2" xml:space="preserve">
    814     <value>All S boxes of cipher 2 behave identically. For this reason it is sufficient to analyze the functionality of a single S box. Basically it is possible to consider 4 parallel S boxes as one big S box, but this would increase the analysis effort. The S box receives 4 bits as input and also outputs 4 bits as output. The 4 input bits are replaced by 4 other output bits.</value>
     814    <value>All S-boxes of cipher 2 behave identically. For this reason it is sufficient to analyze the functionality of a single S-box. Basically it is possible to consider 4 parallel S-boxes as one big S-box, but this would increase the analysis effort. The S-box receives 4 bits as input and also outputs 4 bits as output. The 4 input bits are replaced by 4 other output bits.</value>
    815815  </data>
    816816  <data name="Tutorial2AnalysisOfSBoxSlide1Content3" xml:space="preserve">
    817     <value>Remember: Differential cryptanalysis works with differences of messages. In order to examine the S box, all combinations of input plaintext are considered and their differences are formed. For each pair, the plaintexts are entered individually into the S box and then the difference of the substituted outputs is calculated. The transitions from input to output difference are noted.</value>
     817    <value>Remember: Differential cryptanalysis works with differences of messages. In order to examine the S-box, all combinations of input plaintext are considered and their differences are formed. For each pair, the plaintexts are entered individually into the S-box and then the difference of the substituted outputs is calculated. The transitions from input to output difference are noted.</value>
    818818  </data>
    819819  <data name="Tutorial2AnalysisOfSBoxSlide1Content4" xml:space="preserve">
     
    824824  </data>
    825825  <data name="Tutorial2AnalysisOfSBoxSlide1Header" xml:space="preserve">
    826     <value>Analysis of the S boxes</value>
     826    <value>Analysis of the S-boxes</value>
    827827  </data>
    828828  <data name="Tutorial2AnalysisOfSBoxSlide2Content1" xml:space="preserve">
     
    830830  </data>
    831831  <data name="Tutorial2AnalysisOfSBoxSlide2Header" xml:space="preserve">
    832     <value>Analysis of the S boxes</value>
     832    <value>Analysis of the S-boxes</value>
    833833  </data>
    834834  <data name="Tutorial2AnalysisOfSBoxSlide2InputDifference" xml:space="preserve">
     
    839839  </data>
    840840  <data name="Tutorial2AnalysisOfSBoxSlide3Content1" xml:space="preserve">
    841     <value>The input and output differences and the entries of the difference distribution table are hexadecimal.</value>
     841    <value>The input and output differences and the entries of the difference distribution table are displayed in hexadecimal format.</value>
    842842  </data>
    843843  <data name="Tutorial2AnalysisOfSBoxSlide3Content2" xml:space="preserve">
    844     <value>A 4 bit S box has 16 different inputs and 16 different outputs. If 2 messages are combined to a message pair with disjoint differences, 256 different transitions of differences can be observed.</value>
     844    <value>A 4 bit S-box has 16 different inputs and 16 different outputs. If 2 messages are combined to a message pair with disjoint differences, 256 different transitions of differences can be observed.</value>
    845845  </data>
    846846  <data name="Tutorial2AnalysisOfSBoxSlide3Content3" xml:space="preserve">
     
    848848  </data>
    849849  <data name="Tutorial2AnalysisOfSBoxSlide3Content4" xml:space="preserve">
    850     <value>The distribution of differences is obviously not equally distributed. In practice, S boxes are not perfect. The cryptanalyst makes use of this fact. Particularly high probabilities help with differential cryptanalysis.</value>
     850    <value>The distribution of differences is obviously not equally distributed. In practice, S-boxes are not perfect. The cryptanalyst makes use of this fact. Particularly high probabilities help with differential cryptanalysis.</value>
    851851  </data>
    852852  <data name="Tutorial2AnalysisOfSBoxSlide3Header" xml:space="preserve">
    853     <value>Analysis of the S boxes</value>
     853    <value>Analysis of the S-boxes</value>
    854854  </data>
    855855  <data name="Tutorial2AnalysisSlide1Content1" xml:space="preserve">
     
    857857  </data>
    858858  <data name="Tutorial2AnalysisSlide1Content2" xml:space="preserve">
    859     <value>In the following, the encryption of a plain text block is shown schematically. As in tutorial 1, the internal states during the encryption process are described with variables u and v. The following table shows the encryption of a plain text block.</value>
     859    <value>In the following, the encryption of a plain text block is shown schematically. As in Tutorial 1, the internal states during the encryption process are described with variables u and v. The following table shows the encryption of a plaintext block.</value>
    860860  </data>
    861861  <data name="Tutorial2AnalysisSlide1Content3" xml:space="preserve">
     
    869869  </data>
    870870  <data name="Tutorial2AnalysisSlide3Content1Run1" xml:space="preserve">
    871     <value>One could now try to get the key k</value>
     871    <value>You could now try to get the key k</value>
    872872  </data>
    873873  <data name="Tutorial2AnalysisSlide3Content1Run10" xml:space="preserve">
     
    875875  </data>
    876876  <data name="Tutorial2AnalysisSlide3Content1Run11" xml:space="preserve">
    877     <value>. With the plaintexts one is still able to calculate the difference of the u</value>
     877    <value>. With the plaintexts you are still able to calculate the difference of the u</value>
    878878  </data>
    879879  <data name="Tutorial2AnalysisSlide3Content1Run12" xml:space="preserve">
     
    887887  </data>
    888888  <data name="Tutorial2AnalysisSlide3Content1Run3" xml:space="preserve">
    889     <value> in a similar way to cipher 1. For this you would have a pair of plaintext and their corresponding secret texts available. Then you would guess a possible round key t to calculate the internal variables v</value>
     889    <value> in a similar way to cipher 1. To do so, you would use a pair of plaintext and their corresponding ciphertexts. Then you would guess a possible round key t to calculate the internal variables v</value>
    890890  </data>
    891891  <data name="Tutorial2AnalysisSlide3Content1Run4" xml:space="preserve">
     
    905905  </data>
    906906  <data name="Tutorial2AnalysisSlide3Content1Run9" xml:space="preserve">
    907     <value> is also unknown, one could now calculate the difference of u</value>
     907    <value> is also unknown, you could now calculate the difference of u</value>
    908908  </data>
    909909  <data name="Tutorial2AnalysisSlide3Content2Run1" xml:space="preserve">
    910     <value>Due to the Exclusive-Or, the S box behaves non-linear, so that the difference of the v</value>
     910    <value>Due to the Exclusive-Or, the S-box behaves non-linear, so that the difference of the v</value>
    911911  </data>
    912912  <data name="Tutorial2AnalysisSlide3Content2Run2" xml:space="preserve">
     
    923923  </data>
    924924  <data name="Tutorial2AnalysisSlide3Content3" xml:space="preserve">
    925     <value>To solve this problem, lets take a closer look at how the S boxes work.</value>
     925    <value>To solve this problem, lets take a closer look at how the S-boxes work.</value>
    926926  </data>
    927927  <data name="Tutorial2AnalysisSlide3Header" xml:space="preserve">
     
    965965  </data>
    966966  <data name="Tutorial2AttackFirstRoundContent2Run1" xml:space="preserve">
    967     <value>By clicking on continue, the first two round keys k</value>
     967    <value>By clicking on "Continue", the first two round keys k</value>
    968968  </data>
    969969  <data name="Tutorial2AttackFirstRoundContent2Run2" xml:space="preserve">
     
    10011001  </data>
    10021002  <data name="Tutorial2AttackKeyRound2Content1Run3" xml:space="preserve">
    1003     <value> is to be attacked. S boxes can be selected for this in the second encryption round.  By selecting an S box, the respective 4 bits of the round key are attacked and an attempt is made to restore them.</value>
     1003    <value> is to be attacked. S-boxes can be selected for this in the second encryption round.  By selecting an S-box, the respective 4 bits of the round key are attacked and an attempt is made to restore them.</value>
    10041004  </data>
    10051005  <data name="Tutorial2AttackKeyRound2Content1Run4" xml:space="preserve">
     
    10191019  </data>
    10201020  <data name="Tutorial2AttackKeyRound3Content1Run3" xml:space="preserve">
    1021     <value> of the cipher will be attacked. S boxes can be selected for this in the third encryption round. By selecting an Sbox the respective 4 bits of the round key are attacked and an attempt is made to restore them.</value>
     1021    <value> of the cipher will be attacked. S-boxes can be selected for this in the third encryption round. By selecting an S-box the respective 4 bits of the round key are attacked and an attempt is made to restore them.</value>
    10221022  </data>
    10231023  <data name="Tutorial2AttackKeyRound3Content1Run4" xml:space="preserve">
    1024     <value>In differential cryptanalysis, the change of differences at the S boxes is considered. S boxes should therefore be selected at this point.</value>
     1024    <value>In differential cryptanalysis, the change of differences at the S-boxes is considered. S-boxes should therefore be selected at this point.</value>
    10251025  </data>
    10261026  <data name="Tutorial2AttackKeyRound3Content1Run5" xml:space="preserve">
    1027     <value>The more key bits that are selected, the more complicated the search for a differential. However, it can make sense to attack several S boxes at the same time. Depending on the nature of the cipher, better or worse differentials can be found.</value>
     1027    <value>The more key bits that are selected, the more complicated the search for a differential. However, it can make sense to attack several S-boxes at the same time. Depending on the nature of the cipher, better or worse differentials can be found.</value>
    10281028  </data>
    10291029  <data name="Tutorial2AttackRound2HeaderRun1" xml:space="preserve">
    1030     <value>Select S boxes from round 2 to get key bits from k</value>
     1030    <value>Select S-boxes from round 2 to get key bits from k</value>
    10311031  </data>
    10321032  <data name="Tutorial2AttackRound2HeaderRun2" xml:space="preserve">
     
    10371037  </data>
    10381038  <data name="Tutorial2AttackRound3HeaderRun1" xml:space="preserve">
    1039     <value>Select S boxes from round 3 to get key bits from k</value>
     1039    <value>Select S-boxes from round 3 to get key bits from k</value>
    10401040  </data>
    10411041  <data name="Tutorial2AttackRound3HeaderRun2" xml:space="preserve">
     
    10521052  </data>
    10531053  <data name="Tutorial2CharacteristicSlide1Content1Run2" xml:space="preserve">
    1054     <value> are substituted using the S box by a pair of outputs differing by a difference </value>
     1054    <value> are substituted using the S-box by a pair of outputs differing by a difference </value>
    10551055  </data>
    10561056  <data name="Tutorial2CharacteristicSlide1Content1Run3" xml:space="preserve">
     
    10661066  </data>
    10671067  <data name="Tutorial2CharacteristicSlide1Content2Run2" xml:space="preserve">
    1068     <value> a differential characteristic under the operation of the S box. As seen before, a differential characteristic has a fixed probability.</value>
     1068    <value> a differential characteristic under the operation of the S-box. As seen before, a differential characteristic has a fixed probability.</value>
    10691069  </data>
    10701070  <data name="Tutorial2CharacteristicSlide1Content3" xml:space="preserve">
     
    10751075  </data>
    10761076  <data name="Tutorial2CharacteristicSlide2Content1" xml:space="preserve">
    1077     <value>An encryption round for cipher 2 consists of key addition, substitution and permutation. The cipher works on 16 bit blocks. The previous notation is extended as follows to denote a differential characteristic of an S box for 16 bit blocks</value>
     1077    <value>An encryption round for cipher 2 consists of key addition, substitution and permutation. The cipher works on 16 bit blocks. The previous notation is extended as follows to denote a differential characteristic of an S-box for 16 bit blocks</value>
    10781078  </data>
    10791079  <data name="Tutorial2CharacteristicSlide2Content2" xml:space="preserve">
     
    10961096  </data>
    10971097  <data name="Tutorial2CharacteristicSlide3Content4" xml:space="preserve">
    1098     <value>In the first 4-tuple the input differences of the S boxes of the first 4 S boxes are given in the first encryption round. In the second 4-tuple, both the output difference of the first and the input difference of the second encryption round are noted. In the 3rd 4-tuple, the output difference of the second and the input difference of the last encryption round are noted.</value>
     1098    <value>In the first 4-tuple the input differences of the S-boxes of the first 4 S-boxes are given in the first encryption round. In the second 4-tuple, both the output difference of the first and the input difference of the second encryption round are noted. In the 3rd 4-tuple, the output difference of the second and the input difference of the last encryption round are noted.</value>
    10991099  </data>
    11001100  <data name="Tutorial2CharacteristicSlide3Content5" xml:space="preserve">
     
    11231123  </data>
    11241124  <data name="Tutorial2IntroductionSlide1Content1" xml:space="preserve">
    1125     <value>In tutorial 1 the idea of differential cryptanalysis was introduced and demonstrated with a cipher consisting of one encryption round with two round keys.</value>
     1125    <value>In Tutorial 1 the idea of differential cryptanalysis was introduced and demonstrated with a cipher consisting of one encryption round with two round keys.</value>
    11261126  </data>
    11271127  <data name="Tutorial2IntroductionSlide1Content2" xml:space="preserve">
     
    11411141  </data>
    11421142  <data name="Tutorial2RecoverKeyInformationSlide1Content1" xml:space="preserve">
    1143     <value>Once a differential has been found with a high probability, key bits can be recovered. For this purpose, the S boxes are considered where the expected difference is different from 0.</value>
     1143    <value>Once a differential has been found with a high probability, key bits can be recovered. For this purpose, the S-boxes are considered where the expected difference is different from 0.</value>
    11441144  </data>
    11451145  <data name="Tutorial2RecoverKeyInformationSlide1Content2" xml:space="preserve">
     
    14651465  </data>
    14661466  <data name="Tutorial3WaitingSlideContent1" xml:space="preserve">
    1467     <value>Sie können nun in der DKA-KeyRecovery-Komponente die in der DKA-PfadFinder-Komponente generierte Angriffskonfiguration verwenden, um Schlüsselbits wiederherzustellen. Dazu müssen Sie auf den Start-Button klicken.</value>
     1467    <value>Sie können nun in der DKA-KeyRecovery-Komponente die in der DKA-PfadFinder-Komponente generierte Angriffskonfiguration verwenden, um Schlüsselbits wiederherzustellen. Dazu müssen Sie auf den Button "Start" klicken.</value>
    14681468  </data>
    14691469  <data name="Tutorial3WaitingSlideContent2" xml:space="preserve">
  • trunk/CrypPlugins/DCAPathFinder/UI/Tutorial2/AnalysisSlide2.xaml

    r8361 r8426  
    7171                <TextBlock FontFamily="Courier New" Grid.Row="0" Grid.Column="1" FontSize="20"
    7272                           HorizontalAlignment="Left" Margin="0,217,0,0">
    73                     <controls1:FormulaControl Formula="v_1 = SBox(u_1)" Scale="25" />
     73                    <controls1:FormulaControl Formula="v_1 = S(u_1)" Scale="25" />
    7474                </TextBlock>
    7575
     
    111111                <TextBlock FontFamily="Courier New" Grid.Row="0" Grid.Column="1" FontSize="20"
    112112                           HorizontalAlignment="Left" Margin="0,455,0,0">
    113                     <controls1:FormulaControl Formula="v_2 = SBox(u_2)" Scale="25" />
     113                    <controls1:FormulaControl Formula="v_2 = S(u_2)" Scale="25" />
    114114                </TextBlock>
    115115
     
    151151                <TextBlock FontFamily="Courier New" Grid.Row="0" Grid.Column="1" FontSize="20"
    152152                           HorizontalAlignment="Left" Margin="0,695,0,0">
    153                     <controls1:FormulaControl Formula="v_3 = SBox(u_3)" Scale="25" />
     153                    <controls1:FormulaControl Formula="v_3 = S(u_3)" Scale="25" />
    154154                </TextBlock>
    155155
  • trunk/CrypPlugins/DCAPathVisualiser/Properties/Resources.Designer.cs

    r8416 r8426  
    6262       
    6363        /// <summary>
    64         ///   Sucht eine lokalisierte Zeichenfolge, die Active S boxes: ähnelt.
     64        ///   Sucht eine lokalisierte Zeichenfolge, die Active S-boxes: ähnelt.
    6565        /// </summary>
    6666        internal static string ActiveSBoxes {
  • trunk/CrypPlugins/DCAPathVisualiser/Properties/Resources.resx

    r8416 r8426  
    119119  </resheader>
    120120  <data name="ActiveSBoxes" xml:space="preserve">
    121     <value>Active S boxes:</value>
     121    <value>Active S-boxes:</value>
    122122  </data>
    123123  <data name="Characteristics" xml:space="preserve">
Note: See TracChangeset for help on using the changeset viewer.