Research Article
Related-Key Differential Attacks on Reduced-Round LBlock
Algorithm 3
Get the upper bounds of probability by STP model.
(1) | Function Encryption Algorithm: | (2) | : the number of rounds | (3) | eqn = [ ] //list | (4) | for i 0 to r − 1 do | (5) | Add “;” in eqn | (6) | Add “;” in eqn | (7) | | (8) | Add “;” in eqn | (9) | Add “; ” in eqn | (10) | end | (11) | return eqn | (12) | | (13) | Function Key Schedule Algorithm: | (14) | : the number of rounds | (15) | eqn = [ ] //list | (16) | for i 0 to r − 1 do | (17) | Add “;” in eqn | (18) | Add “;” in eqn | (19) | Add “;” in eqn | (20) | end | (21) | return eqn | (22) | | (23) | Function Main: | (24) | Create a file LBlock.cvc | (25) | eqn = [ ] //list | (26) | Add “; | (27) | | (28) | ; | (29) | ; | (30) | ; | (31) | | (32) | ; | (33) | ;” in eqn | (34) | eqn + = Encryption Algorithm(); | (35) | eqn + = Key Schedule Algorithm(); | (36) | | (37) | Add “;” in eqn | (38) | Add “;” in eqn | (39) | Add “;” in eqn | (40) | write eqn in LBlock.cvc 19 | (41) | | (42) | stp LBlock.cvc |
|