Research Article
BFLP: An Adaptive Federated Learning Framework for Internet of Vehicles
| Input: C, Kenc | | Output: M | | 1: Receiving C | | 2: Generate different the 8 subkey Keyj from the main Key Kenc | | 3: Partition C into 4 segments: C9, C10, C11, C12 | | 4: for each round j = 8 : 1 do | | 5: Permutation: (Cj + !, Cj + 2, Cj + 3) | | 6: X := Cj + 4Cj + 1 | | 7: Y := Mj + 2Mj + 3 Keyj | | 8: Count1 := Count − Zero (X) | | 9: W := f1 (Count1, X) | | 10: R : WY | | 11: Count2 := Count − Zero (R) | | 12: S := f2 (Count2, R) | | 13: Cj := S | | 14: i := i − 1 | | 15: end for | | 16: M := C1||C2||C3||C4 | | 17: Output M |
|