Search

Oral squamous cell carcinoma (OSCC) is the most common head and neck malignancy, with an estimated 5-year survival rate of only 40–50%, largely due to late detection and diagnosis. Emerging evidence suggests that the human microbiome may be implicated in OSCC, with oral microbiome studies putatively identifying relevant bacterial species. As the impact of other microbial organisms, such as fungi and viruses, has largely been neglected, a bioinformatic approach utilizing the Trans-Proteomic Pipeline (TPP) and the R statistical programming language was implemented here to investigate not only bacteria, but also viruses and fungi in the context of a publicly available, OSCC, mass spectrometry (MS) dataset. Overall viral, bacterial, and fungal composition was inferred in control and OSCC patient tissue from protein data, with a range of proteins observed to be differentially enriched between healthy and OSCC conditions, of which the fungal protein profile presented as the best potential discriminator of OSCC within the analysed dataset. While the current project sheds new light on the fungal and viral spheres of the oral microbiome in cancer in silico, further research will be required to validate these findings in an experimental setting.

A proposed stream cipher, RRSC-128AEAD, supports authenticated encryption with associated data (AEAD) for checking both the authenticity and integrity of the message. This cipher includes a key and a nonce of size 128-bit each as input. It produces two different pseudo-random bit streams in parallel. One is used for encryption and another one is used for authentication purposes. It generates 64-bit MAC, based on the National Institute of Standards and Technology standardized (NIST) value, for lightweight security. The cipher efficiency in terms of randomness is analyzed by an online NIST statistical test suite. The design is compared with NIST standardized stream cipher GRAIN-128AEAD. The proposed cipher proves its efficiency in key reintroduction and probability of avoiding key leakage compared to GRAIN-128AEAD. Although both cipher initialization times are the same, some features like two independent bit streams, large internal states, and variable-length associated data and masking technique together made this proposed cipher stronger and more efficient against various types of attacks.

Safety is the most important part of IoT networks. A maximum number of IoT devices are resource constrained, it is difficult to implement strong safety mechanisms. The maximum number of authentication techniques use certificates in which signing and verifying require additional computation and power. Thus, the goal of this paper is to propose a new lightweight encryption-based authentication protocol for resource-controlled devices. In this paper we proposed an authentication protocol that uses RRSC – v1 encryption and one subscriber and several clients. The main objective is to develop an ultralightweight protocol for a very low-resourced sensor network. In this protocol, we have two algorithms, first, one to one encryption-based authentication protocol where the client is the low resource sensor and the subscriber is the edge device in the IoT. Second, the RRSC – V1, encryption algorithm itself. It has many applications for temperature sensors, rain sensors, and smoke sensors as they have very low memories and computing capacity.

Oral biofilms harbour gram-negative bacterial antigen lipopolysaccharide (LPS) involved in oral cancer progression and gram-positive bacterial surface-associated adhesive, lipoteichoic acid (LTA). Thus, we hypothesised that LPS and LTA together would increase the proliferation of cancer cells compared to stimulation by LPS alone. Oral cancer cell lines SCC4, SCC9, SCC25, Cal 27 and the normal oral cell line, OKF6, were studied. The bacterial antigen stimulation indices were determined using the MT Glo assay. Cell proliferation after bacterial antigen stimulation was validated by clonogenic assays. Phosphokinase array, reverse transcription-quantitative polymerase chain reaction (RT-qPCR), and Western blot were employed to study proliferative and apoptotic pathways in bacterial antigen-stimulated cells. Bacterial antigens significantly stimulated Cal 27 (p ≤ 0.001) alone. SCC4 and SCC9 showed negligible stimulation with either antigen, while SCC25 results were comparable to OKF6. The combined antigen stimulation of Cal 27 led to a decrease in phosphorylated p53 and β-catenin and higher PI3K compared to LPS only stimulated cells (p ≤ 0.001). Combined bacterial antigen stimulation results in increased proliferation of Cal 27 cells due to lowering of tumor suppressor proteins and increased tumor proliferation-related proteins.

Breakthrough research in the field of immune checkpoint inhibitors and the development of a human papilloma virus vaccine triggered a plethora of research in the field of cancer immunotherapy. Both had significant effects on the treatment of head and neck squamous cell carcinoma. The advent of preclinical models and multidisciplinary approaches including bioinformatics, genetic engineering, clinical oncology, and immunology helped in the development of tumour-infiltrating lymphocytes (TILs) and chimeric antigen receptor (CAR) T-cell therapy. Here, we discuss different immunotherapies such as adoptive T-cell transfer, immune checkpoint inhibitors, interleukins, and cancer vaccines for the treatment of head and neck cancer. This review showcases the intrinsic relation between the understanding and implementation of basic biology and clinical practice. We also address potential limitations of each immunotherapy approach and the advantages of personalized immunotherapy. Overall, the aim of this review is to encourage further research in the field of immunotherapy for head and neck cancer.

Mass spectrometry (MS) is one of the key technologies used in proteomics. The majority of studies carried out using proteomics have focused on identifying proteins in biological samples such as human plasma to pin down prognostic or diagnostic biomarkers associated with particular conditions or diseases. This study aims to quantify microbial (viral and bacterial) proteins in healthy human plasma. MS data of healthy human plasma were searched against the complete proteomes of all available viruses and bacteria. With this baseline established, the same strategy was applied to characterize the metaproteomic profile of different SARS-CoV-2 disease stages in the plasma of patients. Two SARS-CoV-2 proteins were detected with a high confidence and could serve as the early markers of SARS-CoV-2 infection. The complete bacterial and viral protein content in SARS-CoV-2 samples was compared for the different disease stages. The number of viral proteins was found to increase significantly with the progression of the infection, at the expense of bacterial proteins. This strategy can be extended to aid in the development of early diagnostic tests for other infectious diseases based on the presence of microbial biomarkers in human plasma samples.

IntroductionTransient receptors are related to oral cancer pain. Previously capsaicin (TRPV1 agonist) was shown to induce cell death in oral cancer cells. We hypothesised that these receptors are present in oral cancer.MethodWe examined the presence of cannabinoid receptors (CB1 and CB2) and targets (TRPV1, TRPA1, CaV 3.1, CaV 3.2, CaV 3.3) via quantitative polymerase chain reaction (qPCR) in oral cancer cells SCC4, SCC9, SCC25, Cal27, and normal oral cell line OKF6.ResultCannabinoid receptors are absent in all the cell lines, while TRPA1 is only present in normal cells, but absent in all the oral cancer cell lines. Voltage-gated calcium channels are present in all the cell lines.Conclusion and Future AspectsTRPA1 could be the possible future prognostic indicator of oral squamous cell carcinoma. Future functionality assays could use precancerous cell lines to follow the loss of TRPA1.

The bacterial antigen, lipopolysaccharide (LPS) and disruptions in calcium channels are independently known to influence oral cancer progression. Previously, we found that bacterial antigens, LPS and lipoteichoic acid (LTA) act as confounders during the action of capsaicin on Cal 27 oral cancer proliferation. As calcium channel drugs may affect oral cancer cell proliferation, we investigated the effect of ML218 HCl, a T-type voltage-gated calcium channel blocker, on the proliferation of Cal 27 oral cancer cells. We hypothesized that ML218 HCl could effectively reduce LPS-induced oral cancer cell proliferation. LPS and LTA antigens were added to Cal 27 oral cancer cells either prior to and/or concurrently with ML218 HCl treatment, and the efficacy of the treatment was evaluated by measuring Cal 27 proliferation, cell death and apoptosis. ML218 HCl inhibited oral cancer cell proliferation, increased apoptosis and cell death, but their efficacy was significantly reduced in the presence of bacterial antigens. ML218 HCl proved more effective than capsaicin in reducing bacterial antigen-induced Cal 27 oral cancer cell proliferation. Our results also suggest an interplay of proliferation factors during the bacterial antigens and calcium channel drug interaction in Cal 27. Bacterial antigen reduction of drug efficacy should be considered for developing newer pharmacological agents or testing the efficacy of the existing oral cancer chemotherapeutic agents. Finally, voltage gated calcium channel drugs should be considered for future oral cancer research.

Oral cancer is a major global health problem with high incidence and low survival rates. The oral cavity contains biofilms as dental plaques that harbour both Gram-negative and Gram-positive bacterial antigens, lipopolysaccharide (LPS) and lipoteichoic acid (LTA), respectively. LPS and LTA are known to stimulate cancer cell growth, and the bioactive phytochemical capsaicin has been reported to reverse this effect. Here, we tested the efficacy of oral cancer chemotherapy treatment with capsaicin in the presence of LPS, LTA or the combination of both antigens. LPS and LTA were administered to Cal 27 oral cancer cells prior to and/or concurrently with capsaicin, and the treatment efficacy was evaluated by measuring cell proliferation and apoptotic cell death. We found that while capsaicin inhibits oral cancer cell proliferation and metabolism (MT Glo assay) and increases cell death (Trypan blue exclusion assay and Caspase 3/7 expression), its anti-cancer effect was significantly reduced on cells that are either primed or exposed to the bacterial antigens. Capsaicin treatment significantly increased oral cancer cells’ suppressor of cytokine signalling 3 gene expression. This increase was reversed in the presence of bacterial antigens during treatment. Our data establish a rationale for clinical consideration of bacterial antigens that may interfere with the treatment efficacy of oral cancer.

Digitalization rapidly connected the entire world. Everyday an enormous volumes of digital data produced by billions of intelligent devices which requires safe transmission over internet. If we look into embedded environment, handling massive volume of data is impractical for low power and low memory devices which leads to lightweight concept. The proposed lightweight model includes many symmetric key sequentially. The model follows fiestel network structure where 64 bits input block divided by two 32 bits blocks. Then every half undergoes through various symmetric key algorithms like TE (Triangular Encryption), RPPT (Recursive Pared Parity Technique), RPSPNC( Recursive Positional Substitution on Prime-Nonprime of Cluster), TB(Transformation of Bits) and bits rotation process. A triangular bit sequence generated by TE and from there various encryption as well as decryption techniques[1] have generated by reading bits in a certain order. RPPT encrypts bits by executing logical OR of successive bits. Bit swapping technique is used by TB for encryption and decryption. RPSPNC interchanges bits on the basis of prime-non prime bit position and considers any in between bit sequence as a cipher text. Lastly two resultant sub-blocks are merged to produce cipher text of 64 bits. To check the acceptance of the proposed model, comparisons take place with popular symmetric key algorithm AES and one embedded algorithm RPPT+TB. Software parameters like entropy, n-gram(4-gram), non-homogeneity, histogram are analysed. Hardware analysis of the model ensures us that it falls into lightweight domain by comparing the GE (Gate equivalent) with the ISO /IEC standard value ranges between 1000-2000GE.

COVID-19 pandemic affected many people world-wide. It has become a global issue. The major priority of the scientific community is to control this pandemic. The infection can spread through various ways, mainly by touching a contaminated or infected surface or person-to-person contact (droplets from the oral and nasal passage from an infected person). Increase in the rate of infection can by caused by inadequate hygiene practices and cleanliness. The virus is active up to few hours on various surfaces and time may vary according to the nature of the surface. The virus can continue to spread rapidly by contact surfaces and air. Prevention of further viral spread can be attained by effective disinfection of surface and air. It is suggested that sanitizers (0.1% sodium hypochlorite) can effectively arrest COVID-19 virus within a minute. This paper describes a strong IoT-based disinfectant tunnel which is used to disinfect external surface of objects, clothes, or even human skin to provide protection against COVID-19 in social or public places such as malls, schools, hospitals, airports, and offices. Primarily focusing on the significance, structural design, and functioning of the tunnel. To make the tunnel cost-effective and sustainable, solar panels and steel rods have been used. The disinfectant tunnel is highly efficient as it offers no contact disinfection or sanitization. This sensitization tunnel must detect human to sanitize, this paper illustrates a novel approach of using sensors for human detection, and since this project is based on IoT as backbone, so security model must be there to guard against malicious user. This paper also illustrates end-to-end security model.

e18053 Background: Biofilm formation is a continuous process in oral cancer patients, despite proper extirpation/elimination of a bacterial plaque via a surgical procedure or antibiotic treatment. Also, elimination of a bacterial plaque does not necessarily remove extant bacterial antigen-stimulated oral cancer cells. Therefore, combination drug treatment may be an appropriate approach to elucidate the confounding effects of bacterial antigens on anti-cancer drugs. Methods: Our drug combination strategy addressed both Gram-positive (Lipoteichoic acid [LTA]) and Gram-negative (Lipopolysaccharide [LPS]) bacterial antigens, to determine the effect of anti-cancer drugs on LPS/LTA/LPS+LTA-stimulated preclinical oral cancer models (SCC4, SCC9, SCC25, and Cal 27). The drug combination strategy was designed in six phases of treatment. In phase 1, plated cells were treated with different combinations of bacterial antigens in combination with anti-cancer drugs. In the phases 2 and 3, inhibitory drugs were introduced in the presence of bacterial antigens after 24 hours and 72 hours of bacterial antigen stimulation. In phases 4 and 5, inhibitory drugs were added after 24 hours and 72 hours of bacterial antigen stimulation. In phase 6, inhibitory drugs were applied in the absence of, and without stimulation with, bacterial antigens. Metabolic assays, reverse transcription quantitative PCR, Western blot, Proteome Profiler, apoptotic and ELISA assays were performed to validate the novel drug combination strategy. Results: Anti-cancer drug treatment on preclinical oral cancer models resulted in 43.6% ± 3.3% of precancerous models being apoptotic. To mimic pre-existing unhygenic conditions in oral cancer patients, prior stimulation of preclinical model with LPS+LTA 72 hours before drug treatment, reduced apoptosis to 32.2% ± 1.1% of cells. Apoptosis was almost annulled (2.98% ± 0.3%; p < 0.01) when drug treatment was carried out along with bacterial antigens. Treatment with drugs in the absence of bacterial antigens resulted in significantly more apoptotic cells than in presence of bacterial antigens (p < 0.0001). Metabolic and viability assay showed similar results like apoptotic assay. Conclusions: Bacterial antigens mimic the presence of Gram-negative and Gram-positive bacteria and thus severely affect the efficacy of anti-cancer drugs. The novel drug combination strategy redesigns the pharmacological management of oral squamous cell carcinoma.

Of late, the massive use of pervasive devices in the electronics field has raised the concerns about security. In embedded applications or IoT domain implementing a full-fledged cryptographic environment using conventional encryption algorithms would not be practical because of the constraints like power dissipation, area and speed. To overcome such barriers the focus is on lightweight cryptography. In this paper a new lightweight PRESENT cipher has been proposed which has modified the original PRESENT cipher by reducing encryption round, modifying the Key Register updating technique and adding a new layer in between S-box layer and P-layer of the existing encryption-decryption process. The key register is updated by encrypting its value by adding delta value function of TEA (Tiny encryption algorithm), which is another lightweight cipher. The addition of extra layer helps us to reduce the PRESENT round from 31 to 25 which is the minimum round required for security. The efficiency of the proposed algorithm is increased by encrypting the key register. The proposed algorithm proves its superiority by analyzing different software parameter analysis like N-gram, Non-Homogeneity, Frequency Distribution graph and Histogram.

A Security scheme based on Block Cipher is being designed where the Encoding and Decoding be prepared using Modular Adding, Rotational Shift operation and binary XNOR operation. The original message is stream of bits, & be presumed to be isolated into an amount of blocks having s bits in each of the them, where s be power of 3 (e.g. 3, 9, 27, 81, 243). An amount of 0’s be added at the MSB location of the stream for constructing whole numeral of bits odd in every block. For getting the cipher text the entire operation is done in two phases. In the first phase modular adding is done on neighboring blocks taking modulus of adding be 2s. The amount restores the subsequent block, 1st block remnants unmoved. At the time of summing up, carry turned beginning the MSB be rejected. In the next phase left and right bit rotation are applied on the output stream and logical XNOR was executed on the result to get the cipher text. The technique be employed on blocks with changeable dimensions from 3 to 3n. For decryption, the order of XNOR operation & rotational shift will be reversed and modular decryption will be adopted.

Oral cancer is the most common form of head and neck squamous cell carcinoma (HNSCC) and most frequently presents as oral squamous cell carcinoma (OSCC), which is associated with an alarmingly high mortality rate. Internationally, a plethora of research to further our understanding of the molecular pathways related to oral cancer is performed. This research is of value for early diagnosis, prognosis, and the investigation of new drugs that can ameliorate the harmful effects of oral cancer and provide optimal patient outcomes with minimal long-term complications. Two pathways on which the progression of OSCC depends on are those of proliferation and apoptosis, which overlap at many junctions. Herein, we aim to review these pathways and factors related to OSCC progression. Publicly available search engines, PubMed and Google Scholar, were used with the following keywords to identify relevant literature: oral cancer, proliferation, proliferation factors, genes, mutations, and tumor suppressor. We anticipate that the use of information provided through this review will further progress translational cancer research work in the field of oral cancer.

A non-Feistel block cipher cryptosystem viz. recursive substitutions of bits on prime–nonprime detection of sub-stream (RSBPNDS) is proposed and its FPGA implementation is reported in this paper. RSBPNDS operates by dividing the plaintext into number of blocks with fixed block cipher. A generating function is applied on source block and a target block is received. Combining the entire target block, the cipher text is generated. Block sizes of n-bits, total prime numbers and nonprime numbers are calculated in the range 0 to (2n − 1). These prime-numbers and nonprime numbers are encoded with minimum number of bits, suppose the value of the block is 12 then there are six primes and six nonprimes, so number of minimum bits required to encode is three. Select each source block and calculate its value then map to prime number set and nonprime number set. The superiority of the proposed algorithm, in comparison to RSA, is validated by the results of non-homogeneity and avalanche tests.

Digitization has transformed our world. The famous World Wide Web, various social networks and numerous e-commerce applications are responsible to generate huge volume of data regularly. The emerging data security mechanisms ensures a safe transmission of information through the internet. Symmetric key cryptography is one of the key techniques used for the security of large data transmission over the internet. Some popular symmetric key algorithms; TDES, IDEA, AES etc. The proposed model uses several symmetric key algorithms in cascaded manner. The model is first divided into 64 bits plaintext block and then into two sub-blocks of 32 bits. The left and right blocks go through a list of symmetric key cryptography techniques like TR, RPPT, TB and RPSPNC and bit rotation in one step. TR stands for Triangular Encryption, which is responsible to generate a triangle shape bit stream where different encryption-decryption techniques are achieved by the order of reading bit RPPT (Recursive Pared Parity Technique) a very simple space efficient encryption algorithm produces cipher text by performing logical OR of consecutive bits. Transformation of Bits (TB) uses swapping method of bits of different order for encryption and decryption process. Recursive Positional Substitution on Prime-Nonprime of Cluster (RPSPNC) methodology swaps bits based on prime/non prime bit position and generates intermediate bit stream as a cipher text. Finally merge the two halves sub-blocks to get the 64 bits cipher text. To test the feasibility of the proposed model it is compared with AES and another embedded encryption technique RPPT+TB for entropy, non-homogeneity, n-gram(4-gram) test, frequency distribution graph and FPGA based hardware test.

In this article a new Cryptographic System based on Modular Arithmetic using block ciphers has been considered. The original data which is a stream of bits, is assumed to be divided into a number of blocks & each block contains m bits, where m is anyone of (3, 9, 27, 81, 243). The technique is based on the concept of data redundancy. A Number of redundant zeros will be appended at the MSB of bit stream to make total number of bits odd in each block. The binary addition has been made between first and the ultimate block taking modulus of addition as 2m. The sum replaces the content of ultimate block, first block remains unaltered to get the cipher text. In the next step the binary addition has been made between the ultimate block and the second block and the result replaces the second block. The technique proposed here involves operations on non-contiguous blocks (unless only two blocks are left which are adjacent to one another). In any two consecutive operations, one block is common, which makes the encryption unpredictable and thereby enhances security. The carry generated (if any) out of the MSB is discarded. The technique is applied on blocks with varying sizes from 3 to 3n. The modulo subtraction technique is adopted for decryption to get back the plain text.

In this article a new Cryptographic System based on Block Cipher has been planned where the Encryption and Decryption are done based on Modular Arithmetic. Hence the title of the article is suggested as Modular Encryption and Decryption Technique (MEDT). The plain text message which is a stream of bits, is assumed to be separated into a number of blocks & each block contains m bits, where m is anyone of (3, 9, 27, 81, 243). Number of zeros will be appended at the MSB of bit stream to make total number of bits odd in each block. The binary addition has been made on contiguous blocks taking modulus of addition as 2m. The sum replaces the second block, first block remains unaltered. Similar operation will be continued for second and third blocks and so on till all the blocks are exhausted to get the cipher text. During summation the carry generated (if any) out of the MSB is discarded. The technique is applied on blocks with varying sizes from 3 to 3n. The modulo subtraction technique is adopted for decryption to get back the plain text.

Security solutions in today’s data driven solutions have become an inevitable part. Through this privacy, confidentiality and trust can be achieved and this cascaded technique is proposed. Cryptography is most preferred methods to achieve these goals and cryptography is implemented/realized through applied mathematics. Symmetric key cryptography is most efficient method for the security of big data and almost all established symmetric key algorithms; Triple Data Encryption Standard, International Data Encryption Algorithm, Advanced Encryption Standard; are based on Feistel block cipher. This proposed cascaded technique is a non-Fiestel block cipher where plaintext is divided into n number of blocks and each blocks are applied with two encryption functions; Recursive Selected Block Prime-Non-Prime Differential Substitution and Triangular Encryption; in cascaded manner. To achieve good entropy and avalanche; one can apply Cipher Feedback mode to generate final ciphertext by encrypting block by block. This proposed cascaded technique; for its feasibility; is compared with RSA in non-homogeneity, N-gram, floating frequency, avalanche ratio test and entropy test.

In this paper, an asymmetric cryptosystem Rabin Cryptosystem has been modified by adding an advanced message authentication system with it. The proposed modified Rabin Cryptosystem is a combination of symmetric and asymmetric key cryptosystem that is hybrid cryptosystem. In the symmetric part, the sender and the receiver share a secret key between themselves which is added with the plaintext to change the plaintext. The shared secret key is fixed for a session between two users. It can be different for different sessions and different users. In the asymmetric part, the modified plaintext is encrypted using Rabin Cryptosystem. Two extra values will be sent along with the cipher text to the receiver. In the decryption process, Chinese Remainder Theorem will be applied along with the two extra values which were received with the cipher text to decipher it. Then the shared secret key between the sender and the receiver will have to be applied to get the original plaintext. Even if any intruder succeeds to decipher the cipher text, he would get the modified plaintext. As he I. Introduction Technology around us is growing very fast, and security has become the major issue in this fast growing technical world. Every moment a new threat is being produced to disrupt the security of both data and network, and to guard us against these security threats, many new security mechanisms are also being produced. Cryptography is one very ancient yet strong mechanism that saves our data from the hands of the attackers. In this paper, we have proposed a new cryptographic mechanism which is a fine combination of symmetric and asymmetric cryptosystem. Section 1 contains the detailed description of the algorithm proposed, along with the flowchart and example of encryption and decryption process. Section 2 contains some results of the encryption and decryption procedure of the Modified Rabin Cryptosystem. It also shows the performance analysis and comparisons of the Modified Rabin Cryptosystem with RSA and Rabin Cryptosystem using several parameters. Section 3 describes the contribution of this paper in the field of cryptography. In section 4 we have drawn the conclusion of this paper. Section 5 shows the acknowledgement, and in the last section we have listed the references.

Security Solutions can never be completely and permanently developed. It may be true that One Time Pad might be one of the most complete Cryptosystems ever designed. That being said, it's not always that One Time Pad can be used. There are many applications where a lightweight but powerful Cryptosystem is required. This is where CRYPSTER comes in. The CRYPSTER is a modification on the platform of Recursive Paired Parity Technique (RPPT). This is a very lightweight but efficient cryptosystem which would provide a hard challenge even against Brute Force Attacks.

The prolific growth of network communication system entails high risk of breach in information security. This substantiates the need for higher security for electronic information. Cryptography is one of the ways to secure electronic documents. In this paper, we propose a new block cipher, TRIPLE SV (3SV), with 256-bit block size and 112-bit key length. Generally, stream ciphers produce higher avalanche effect but Triple SV shows a substantial rise in avalanche effect with a block cipher implementation. The CBC mode has been used to attain higher avalanche effect. The technique is implemented in C language and has been tested for feasibility.

Proposed FPGA based technique considers a message as a binary string on which ROBAST is applied. A block of n-bits is taken as an input stream, where n ranges from 8 to 256 – bit, then ROBAST is applied in each block to generate intermediate stream, any one intermediate stream is considered as a cipher text. The same operation is performed repeatedly on various block sizes. It is a kind of block cipher and symmetric in nature hence decoding is done in similar manner. This paper also presents an efficient hardware realization of the proposed technique using state-of-the-art Field Programmable Gate Array (FPGA). The technique is also coded in C programming language and Very High Speed Integrated Circuit Hardware Description Language (VHDL). Various results and comparisons have been performed against industrially accepted RSA and TDES. A satisfactory results and comparisons are found.