http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Padmavathy, R.,Bhagvati, Chakravarthy Korea Information Processing Society 2010 Journal of information processing systems Vol.6 No.3
The present study investigates the difficulty of solving the mathematical problem, namely the DLP (Discrete Logarithm Problem) for ephemeral keys. The DLP is the basis for many public key cryptosystems. The ephemeral keys are used in such systems to ensure security. The DLP defined on a prime field $Z^*_p of random prime is considered in the present study. The most effective method to solve the DLP is the ICM (Index Calculus Method). In the present study, an efficient way of computing the DLP for ephemeral keys by using a new variant of the ICM when the factors of p-1 are known and small is proposed. The ICM has two steps, a pre-computation and an individual logarithm computation. The pre-computation step is to compute the logarithms of a subset of a group and the individual logarithm step is to find the DLP using the precomputed logarithms. Since the ephemeral keys are dynamic and change for every session, once the logarithms of a subset of a group are known, the DLP for the ephemeral key can be obtained using the individual logarithm step. Therefore, an efficient way of solving the individual logarithm step based on the newly proposed precomputation method is presented and the performance is analyzed using a comprehensive set of experiments. The ephemeral keys are also solved by using other methods, which are efficient on random primes, such as the Pohlig-Hellman method, the Van Oorschot method and the traditional individual logarithm step. The results are compared with the newly proposed individual logarithm step of the ICM. Also, the DLP of ephemeral keys used in a popular password key exchange protocol known as Chang and Chang are computed and reported to launch key recovery attack.
( R. Padmavathy ),( Chakravarthy Bhagvati ) 한국정보처리학회 2010 Journal of information processing systems Vol.6 No.3
The present study investigates the difficulty of solving the mathematical problem, namely the DLP (Discrete Logarithm Problem) for ephemeral keys. The DLP is the basis for many public key cryptosystems. The ephemeral keys are used in such systems to ensure security. The DLP defined on a prime field p Z(*p) of random prime is considered in the present study. The most effective method to solve the DLP is the ICM (Index Calculus Method). In the present study, an efficient way of computing the DLP for ephemeral keys by using a new variant of the ICM when the factors of p-1 are known and small is proposed. The ICM has two steps, a pre-computation and an individual logarithm computation. The pre-computation step is to compute the logarithms of a subset of a group and the individual logarithm step is to find the DLP using the pre-computed logarithms. Since the ephemeral keys are dynamic and change for every session, once the logarithms of a subset of a group are known, the DLP for the ephemeral key can be obtained using the individual logarithm step. Therefore, an efficient way of solving the individual logarithm step based on the newly proposed pre-computation method is presented and the performance is analyzed using a comprehensive set of experiments. The ephemeral keys are also solved by using other methods, which are efficient on random primes, such as the Pohlig-Hellman method, the Van Oorschot method and the traditional individual logarithm step. The results are compared with the newly proposed individual logarithm step of the ICM. Also, the DLP of ephemeral keys used in a popular password key exchange protocol known as Chang and Chang are computed and reported to launch key recovery attack.
Cryptanalysis on a Three Party Key Exchange Protocol-STPKE'
Tallapally, Shirisha,Padmavathy, R. Korea Information Processing Society 2010 Journal of information processing systems Vol.6 No.1
In the secure communication areas, three-party authenticated key exchange protocol is an important cryptographic technique. In this protocol, two clients will share a human-memorable password with a trusted server, in which two users can generate a secure session key. On the other hand the protocol should resist all types of password guessing attacks. Recently, STPKE' protocol has been proposed by Kim and Choi. An undetectable online password guessing attack on STPKE' protocol is presented in the current study. An alternative protocol to overcome undetectable online password guessing attacks is proposed. The results show that the proposed protocol can resist undetectable online password guessing attacks. Additionally, it achieves the same security level with reduced random numbers and without XOR operations. The computational efficiency is improved by $\approx$ 30% for problems of size $\approx$ 2048 bits. The proposed protocol is achieving better performance efficiency and withstands password guessing attacks. The results show that the proposed protocol is secure, efficient and practical.
An Improved Fast and Secure Hash Algorithm
Agarwal, Siddharth,Rungta, Abhinav,Padmavathy, R.,Shankar, Mayank,Rajan, Nipun Korea Information Processing Society 2012 Journal of information processing systems Vol.8 No.1
Recently, a fast and secure hash function SFHA - 256 has been proposed and claimed as more secure and as having a better performance than the SHA - 256. In this paper an improved version of SFHA - 256 is proposed and analyzed using two parameters, namely the avalanche effect and uniform deviation. The experimental results and further analysis ensures the performance of the newly proposed and improved SFHA-256. From the analysis it can be concluded that the newly proposed algorithm is more secure, efficient, and practical.
An Improved Fast and Secure Hash Algorithm
( Siddharth Agarwal ),( Abhinav Rungta ),( R. Padmavathy ),( Mayank Shankar ),( Nipun Rejan ) 한국정보처리학회 2012 Journal of information processing systems Vol.8 No.1
Recently, a fast and secure hash function SFHA - 256 is has been proposed and claimed as more secure and as having a better performance than the SHA - 256. In this paper an improved version of SFHA - 256 is proposed and analyzed using two parameters, namely the avalanche effect and uniform deviation. The experimental results and further analysis ensures the performance of the newly proposed and improved SFHA-256. From the analysis it can be concluded that the newly proposed algorithm is more secure, efficient, and practical.
Padmavathi, M.,Srinivas, K.P.,Reddy, Ch. V. Subba,Ramesh, B.,Navodayam, K.,Krishnaprasadji, J.,Babu, P. Ratan,Sreenivasulu, P. The Korean Society of Plant Pathology 2011 Plant Pathology Journal Vol.27 No.1
The genome of a potyvirus isolate associated with chlorotic spots and vein banding symptoms on Spathiphyllum spp., in Andhra Pradesh state, India was amplified by RT-PCR using degenerate potyvirus primers, amplicons cloned, and sequence (1.6 kb) analyzed. This virus isolate shared maximum identity of 74.8% and 80.2% at coat protein (CP) gene nucleotide (906 nucleotides) and amino acid (302 amino acids) levels, respectively with Dasheen mosaic virus (DsMV)-M13 isolate reported from China. But its 3'-UTR (258 nucleotides) had maximum identity of 62.5% with DsMV-Vietnam isolate. The deduced molecular weight of CP is 33.57 kDa and it contained DAG triplet in its N-terminal region. In CP amino acid based phylogenetic analysis, this virus isolate represented a separate branch but closer to DsMV isolates cluster. Based on the molecular criteria set for the discrimination of species and genus in the Potyviridae family, the present virus isolate was identified as a distinct virus species in the genus Potyvirus and proposed the name Spathiphyllum chlorotic vein banding virus (SCVbV).
Padmavathi, Thangella A.V.,Rao, Daggu Manohar 한국작물학회 2013 Journal of crop science and biotechnology Vol.16 No.2
The study investigates the differential accumulation of osmolytes and their contribution to osmotic adjustment in leaf tissue of peanut under drought stress. Plants of four peanut cultivars, obtained from ICRISAT, with varying degrees of drought tolerance were subjected to 10, 15, and 20 days of drought stress by withholding irrigation to 20-day-old seedlings. Leaf samples were collected on $31^{st}$, $36^{th}$, and $41^{st}$ days from these stressed plants along with their respective controls. The results indicated that ICGV 91114 was the most drought-tolerant variety followed by ICGS 76 and J 11, while JL 24 was the most drought susceptible. The leaves of ICGV 91114 maintained higher RWC and chlorophyll pigments under water stress compared to JL 24. The contents of all the biochemicals were found to be the maximum in ICGV 91114 and least in JL 24 during stress periods. Drought induced increase in the contents of TSS and TRS were significantly higher in ICGV 91114 under 15 days of water stress compared to the other three varieties and stress periods, while TLP, total free amino acids and total proline were higher in 20-day-old stressed plants of ICGV 91114 and the lowest in 10-day-old stressed plants of JL 24. In the control plants of all four varieties, there was a steady increase in the contents of all these biochemicals with an increase in the age of the plants. The results suggest that osmolytes act as important compatible solutes to maintain osmotic balance, to protect cellular macromolecules, and scavenge free radicals under water stress conditions.