|
| |
Algorithm
RFC
RFC – Introduction
RFC
is a symmetric
crypto algorithm (secret
keys) allowing a secure and rapid encrypting and decrypting of messages.
RFC
has been designed particularly for:
-
Extremely secure communications in military applications;
-
To combine a high security level over a long period of time
-
To be implemented on multiple platforms.
RFC – The Method
It is an Stream Cipher Algorithm, designed for military and
e-commerce applications being small in complexity it is simple to implement
and has a very small footprint in software and hardware terms.(*)
In the stream cipher phase the algorithm processes a group of bytes.
(**)
RFC
is based on sub-keys allowing a simultaneous permutation and substitution of
bytes on a single per byte basis.
The key has a length that varies from a minimum size of 64 bit to a maximum
of 4096 bit. In all phases of the stream cipher, calculation will always use
different sub-keys ( use 512 bit per group of bytes).
RFC – Mathematical functions
RFC uses
a “Non linear cross substitution method” (two tables) combined
with the “Modified Pseudo-Hadamard Transform” together with a
particular function known as “Group Bytes Intersection”.
The “Modified Pseudo-Hadamard Transform” creates a
superposition of effects and completes the process of diffusion and
confusion in the bit lebel of the message.
Synergies between these functions results in producing a very
high level of security.
The maximum size of the table (used in RAM memory) is equal to 2048
bytes; (AES, for example has need up to 4400 byes)
(*) Simplicity of algorithm simplifies the task of
cryptanalysis to assess its robustness.
(**) The group is generally a multiple of 16 byte.
|
![[Immagine logo società]](images/R-E-System.jpg)
