Manjula G
@www,bgscet.ac.in
Associate Professor Dept of CSE
BGS College of Engineering and Technology
EDUCATION
BE in CSE 2001
MTech in CSE 2010
Ph,D in CSE 2021
RESEARCH INTERESTS
Information Security,Artificial Intelligence,Machine Learning,Data Science
Scopus Publications
Scholar Citations
Scholar h-index
Scholar i10-index
Scopus Publications
H. V. Chaitra, Madhu Patil, G. Manjula, M. K. Bindiya, and E. Naresh
Springer Science and Business Media LLC
Achyutha Prasad N., Chaitra H.V., Manjula G., Mohammad Shabaz, Ana Beatriz Martinez-Valencia, Vikhyath K.B., Shrawani Verma, and José Luis Arias-Gonzáles
Elsevier BV
Manjula G, Pratibha Deshmukh, Udaya Kumar N. L., Víctor Daniel Jiménez Macedo, Vikhyath K B, Achyutha Prasad N, and Amit Kumar Tiwari
Auricle Technologies, Pvt., Ltd.
In today's generation, the demand for data rates has also increased due to the rapid surge in the number of users. With this increasing growth, there is a need to develop the next fifth generation network keeping in mind the need to replace the current 4G cellular network. The fifth generation (5G) design in mobile communication technology has been developed keeping in mind all the communication needs of the users. Heterogeneous Cloud Radio Access Network (H-CRAN) has emerged as a capable architecture for the newly emerging network infrastructure for energy efficient networks and high data rate enablement. It is considered as the main technology. Better service quality has been achieved by developing small cells into macro cells through this type of network. In addition, the reuse of radio resources is much better than that of homogeneous networks. In the present paper, we propose the H-CRAN energy-efficient methods. This energy-efficient algorithm incorporates an energy efficient resource allocation management design to deal to heterogeneous cloud radio access networks in 5G. System throughput fulfillment is elevating by incorporating an efficient resource allocation design by the energy consumption model. The simulation results have been demonstrated by comparing the efficiency of the introduced design with the existing related design.
Manjula GS and T. Meyyappan
IEEE
Data deduplication (Dedup) is commonly used in the cloud to save bandwidth and storage space by removing duplicate data sets before sending. Data integrity is protected during the Dedup process by encrypting it before it is reused. This paper proposes a DPMM framework for data privacy and memory management in a big data server using a hybrid hashing method. Some programmes use Apache Hadoop because the Hadoop Distributed File System (HDFS) offers a highly dependable static imitation strategy for processing data. The limitations are each file has a different access rate, using the same imitation factor across the board can weaken the performance. Considering this limitations, a research approach has been proposed to utilize predictive examination for progressively imitating the data. So to attain greater efficiency, Dynamic Data Partial Imitation (DDPI) algorithm is implemented, which helps to avoid excessive memory consumption. In the proposed, we have executed the partial imitation technique (DPMM), i.e., the data is fragmented and stored in four Hadoop servers partially to achieve fault tolerance. The proposed method provides the user-requested files even when there is a problem in any servers by this partial imitation technique. Before the imitation process, the files uploaded are checked for duplication to avoid repetition by implementing Secure Hash Algorithm-1 and 2 (SHA1 & SHA2) that apply the hash code of data to check ownership with code verification, thus reducing the excess consumption of storage. Finally, this method is compared with existing methods of execution time for various file sizes. The implemented result demonstrates that this proposed methodology gives much more efficient performance, redundancy and overhead is received.
Manjula G and Mohan H S
ACM
Hiding data using encryption is the major solution to deliver security for data transmitted over a connection amongst any pair of nodes, however by adopting selective encryption, the speed and security can be provided by encoding only a specified portion of the data bit. Visual and multimedia data protections such as images require special design considerations for use in medical applications. This research focuses on choosing an significant part of the medical image to hide the secret data and that can be achieved efficiently by selecting parts of the image that are more used in the normal mode. When the process of encryption is complete, the secured and encrypted data is transmitted to ensure a safe transport and delivery over the public network. This paper intends to propose a novel approach to encrypt data in medical images using probability equation for random selection of blocks for encryption. The background idea with respect to the proposed effort is to encrypt only fragment of the image for encryption using AES algorithm instead of encrypting the whole image. By doing th is we can save computation power, time and speed than using the traditional approach.
G. Manjula and H.S. Mohan
IEEE
With the development of information technology and increasing demands for information security, various encryption methods have been attracted more and more attention in recent years. AES is one such symmetric key algorithm used for securing the data that transmits in the Internet. The strength of AES block cipher depends on the S-Box structure which is a nonlinear substitution operation. S-Boxes are fundamental component of symmetric key algorithms which performs substitution. Since the Substitution boxes are dynamically created, this fact makes it clear that both linear and differential cryptanalysis cannot be done on Dynamic S-Boxes. They are basically used in block ciphers to make the affiliation between key and cipher text more unfamiliar. There are lots of techniques used for generation of S-Box such as key dependent S-Box in which S-Box depends on the key, Bijection, Strict Avalanche criterion etc. This paper briefly analyzes the structure of AES algorithm and a dynamic S-Box is generated based on hash function. Also, the eminence of generated S-Box is been experimentally evaluated and compared along with the original AES for the simulation time.
Manjula G. and Mohan H.S.
IEEE
As the rapid evolution of digital data transaction in E-way is expanding, information safety is emerging with much more importance in data storage and broadcast. Cryptography has emerged as a significant solution which portrays a vivacious role in securing the information against several attacks. Advanced Encryption Standard block cipher (Known as AES) is an extensively studied and widely used cryptographic block cipher system to secure data and information. The strength of AES algorithm is determined by the choice of S-Box along with other aspects. This paper proposes a new technique to generate S-Box dynamically which will intensify the complexity of S-Box construction to encounter any possible attack on the fixed S-Box. Predefined static S-Boxes pose a weak point for the attackers to analyze certain cipher text pairs. The new S-boxes created are additionally dynamic, random and key dependent which attempts to escalate the complexity of the algorithm and furthermore mark the cryptanalysis more challenging. This paper discusses the importance of substitution S-boxes, their role in ensuring the strength of a cipher system and finally describes a new approach of generating dynamic S-box which is constructed centered on round key.