Yamaguchi, Okayama, and Miyahara proposed a simple but efficient authentication system, SPLICE/AS. In this article, we show that their method is vulnerable to the guessing attack. An attacker can obtain the password, private-key, and public-key of the user. To overcome the vulnerability of SPLICE/AS to the guessing attack, we propose an improvement of their system. In our scheme, we not only pr...

To provide secure authentication for wireless sensor networks (WSNs), recently Jiang et al. proposed an efficient two-factor user authentication scheme with unlinkability. They argued that the scheme provides resilience of privileged insider attack, stolen-verifier attack, password guessing attack, weak stolen smart card attack, replay attack, forgery attack, identity guessing attack and tracki...

In 2010, Yeh et al. proposed two robust remote user authentication schemes using smart cards; their claims were such that their schemes defended against ID-theft attacks, reply attacks, undetectable on-line password guessing attacks, off-line password guessing attacks, user impersonation attack, server counterfeit attack and man-in-the-middle attack. In this paper, we show that Yeh et al.’s sch...

Artikel ini mengulas tentang penggunaan campur kode dalam judul artikel majalah elektronik Pesona. Majalah didedikasikan untuk para wisatawan yang ingin mengetahui lebih jauh budaya dan destinasi Indonesia. Sasaran adalah domestik mancanegara. Penelitian mengidentifikasi bentuk jenis pada headline pesona faktor penyebab munculnya kode.. Data menunjukkan bahwa penulisan aertikel tersebut menggun...

We give two results on guessing unbounded subsets of λ+. The first is a positive result and applies to the situation of λ regular and at least equal to א3, while the second is a negative consistency result which applies to the situation of λ a singular strong limit with 2 > λ+. The first result shows that in ZFC there is a guessing of unbounded subsets of S + λ . The second result is a consiste...

In this paper we demonstrate how to use Mixed Integer Linear Programming to optimize guessing strategies for algebraic cryptanalysis with applications to the block cipher EPCBC. Using our optimized guessing strategy we are able to attack 5 rounds of EPCBC96 and 8 rounds of EPCBC-48 faster than brute force using one and two known plaintexts resp. Finally, we are able to identify a class of weak ...