Real time applications (RTA) are application programs that function within a specific timescale. Voice over IP (VoIP) and video conferences are examples of RTA. Transmitting such data via open networks is risky. However, any security must be lightweight and cause no delay. Recently, many algorithms have been created, but very few are viable with RTA. In cryptography, `key space’ refers to the number of possible keys that can be used to generate the key from the keys container.
In this paper, a tesseract is applied for the first time with RTA The tesseract functions with the suggested method to create a key that can generate 768!-bits. However, only three keys are selected from the tesseract key’s home, which are 128, 256 and 512-bits. Three different rounds will be utilized to create the key. This algorithm is considered to be fast and strong because the rounds and XOR-ing operation are lightweight and cheap.