LOGARITHMIC KEYING

SEMINAR ON LOGARITHMIC KEYING :Consider a interaction system where each procedure needs to safely exchange information with its nearby methods. In this system, each sent information is secured using one or more symmetrical important factors that are contributed only between two processes: – the procedure that delivers the information and the nearby procedure that gets the information. A uncomplicated structure for determining symmetrical important factors to the different methods in such a system is to determine each procedure O(d) important factors, where d is the most of others who live nearby of any procedure in the system.
This document shows a more efficient structure for determining symmetrical important factors to the different methods in a interaction system. This structure is called logarithmic entering, which assigns O(log d)symmetric important factors to each procedure in the system. We show that logarithmic entering can be used in rich sessions of interaction systems that include celebrity systems, heavy bipartite systems.

No comments:

Post a Comment