Search
Now showing items 1-4 of 4
Path complexity of maximum segment sum problem
(Dhirubhai Ambani Institute of Information and Communication Technology, 2009)
Various software complexity metrics have been proposed in literature. A program complexity measure called path complexity is proposed in [1]. Path complexity P(A,n) of an algorithm A is defined to be the number of program ...
Efficient ASIC implementation of advanced encryption standard
(Dhirubhai Ambani Institute of Information and Communication Technology, 2008)
In spite of the many defense techniques, software vulnerabilities like buffer overflow, format string vulnerability and integer vulnerability is still exploited by attackers. These software vulnerabilities arise due to ...
On size balanced binary search trees
(Dhirubhai Ambani Institute of Information and Communication Technology, 2009)
History independent data structures are useful when security and privacy are of primary concern. Even if an adversary gets copy of the data structure, he cannot obtain any additional information beyond its content. Important ...
Path complexity of the class binary search tree
(Dhirubhai Ambani Institute of Information and Communication Technology, 2009)
Path complexity of a program is defined as the number of program execution paths as a function of input size n. This notion of program complexity has been extended to complexity of a class as follows. Class had data members ...