Learn More
Kim, C. and D.H. Lee, Separating k-separated eNCE graph languages, An eNCE graph grammar is k-separated (k > 1) if the distance between any two nonterminal nodes in any of its sentential forms is at least k. Let SEP, denote the class of graph languages generated by SEPl (SEP2) is the class of eNCE (boundar E) graph languages, Recently, Engelfriet et al.(More)
Recently, Lee et al. [S. authenticated key agreement scheme, Appl. Math. Comput., in press] showed that Lee–Lee password-based authenticated key agreement scheme [N. Further improvement on the modified authenticated key agreement scheme, Appl. Math. Comput. 157 (2004) 729–733] is vulnerable to an off-line dictionary attack and proposed an improved scheme.(More)