نتایج جستجو برای: استاندارد epc c1 g2

تعداد نتایج: 78851  

2013
Kalikinkar Mandal Xinxin Fan Guang Gong

A pseudorandom number generator is an important component for implementing security functionalities on RFID tags. Most previous proposals focus on true random number generators that are usually inefficient for low-cost tags in terms of power consumption, area, and throughput. In this contribution, we propose a lightweight pseudorandom number generator (PRNG) for EPC Class-1 Generation-2 (EPC C1...

Journal: :IACR Cryptology ePrint Archive 2015
Behzad Abdolmaleki Hamidreza Bakhshi Karim Baghery Mohammad Reza Aref

In the past few years, the design of RFID authentication protocols in accordance with the EPC Class-1 Generation-2 (EPC C1 G2) standards, has been one of the most important challenges in the information security domain. Although RFID systems provide user-friendly services for end-users, they can make security and privacy concerns for them. In this paper we analyze the security of an RFID mutual...

Journal: :IEICE Transactions 2009
Ki Yong Jeon Sung Ho Cho

In this letter, we propose a new scheme for the tag structure of the EPCglobal Class-1 Generation-2 (EPC C1 Gen2) standard equipped with a channel encoding block and the corresponding decoding block in the receiver of the reader system. The channel coded tag is designed to fully accommodate the EPC C1 Gen2 standard. The use of the proposed channel encoding block increases the number of logic ga...

2014
Seyed Mohammad Alavi Karim Baghery Behzad Abdolmaleki

Recently, due to widespread use of Radio Frequency IDentification (RFID) systems in personal applications, security and privacy of these systems have got more attention. In order to provide security and privacy of RFID users, different authentication protocols have been proposed. In 2014, Mohammadi et al. proposed an improved authentication protocol for RFID systems. They claimed that their pro...

Journal: :IACR Cryptology ePrint Archive 2015
Seyed Salman Sajjadi GhaemMaghami Afrooz Haghbin Mahtab Mirmohseni

Radio Frequency Identification (RFID) applications have spread all over the world and, in order to provide their security and privacy, researchers proposed different kind of protocols. In this paper, we analyzes the privacy of a new protocol, proposed by YuJehn in 2015 which is based on Electronic Product Code Class1 Generation 2 (EPC C1 G2) standard. By applying the Ouafi-Phan privacy model, w...

Journal: :IACR Cryptology ePrint Archive 2011
Masoumeh Safkhani Nasour Bagheri Majid Naderi

In this paper, we analyze the security of AZUMI protocol which is compliant with the EPCClass-1 Generation-2 standard and recently has been proposed by Peris et al. This protocol is an improvement to a protocol proposed by Chen and Deng which has been cryptanalysed by Peris et al. and Kapoor and Piramuthu. However, our security analysis clearly shows that the designers were not successful in th...

Journal: :IACR Cryptology ePrint Archive 2013
Nasour Bagheri Masoumeh Safkhani

Peris-Lopez et al. recently provides some guidelines that should be followed to design a secure yoking-proof protocol [10]. In addition, conforming to those guidelines and EPC C1 G2, they presented a yoking-proof for low-cost RFID tags, named Kazahaya. However, in this letter, we scrutinize its security showing how an passive adversary can retrieve secret parameters of patient’s tag in cost of ...

Journal: :The art of discrete and applied mathematics 2023

A vertex colouring f: V(G) → C of a graph G is complete if for any c1, c2 ∈ with c1 ≠ there are in adjacent vertices v1, v2 such that f(v1) = and f(v2) c2. The achromatic number the maximum achr(G) colours proper G. Let G1▫G2 denote Cartesian product graphs G1 G2. In paper achr(Kr2 + r 1▫Kq) determined an infinite q’s provided finite projective plane order.

2005
BÉLA BOLLOBÁS ALEXANDR KOSTOCHKA KITTIKORN NAKPRASIT

In 1978, Bollobás and Eldridge [5] made the following two conjectures. (C1) There exists an absolute constant c > 0 such that, if k is a positive integer and G1 and G2 are graphs of order n such that ∆(G1),∆(G2) n− k and e(G1), e(G2) ckn, then the graphs G1 and G2 pack. (C2) For all 0 < α < 1/2 and 0 < c < √ 1/8, there exists an n0 = n0(α, c) such that, if G1 and G2 are graphs of order n > n0 s...

2013
Kalikinkar Mandal Guang Gong

Pseudorandom number generators play an important role to provide security and privacy on radio frequency identification (RFID) tags. In particular, the EPC Class 1 Generation 2 (EPC C1 Gen2) standard uses a pseudorandom number generator in the tag identification protocol. In this paper, we first present a pseudorandom number generator, named the filtering nonlinear feedback shift register using...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید