Public-Key Cryptography for RFID-Tags
暂无分享,去创建一个
Tim Kerins | Ingrid Verbauwhede | Nele Mentens | Lejla Batina | Jorge Guajardo | Pim Tuyls | J. Guajardo | P. Tuyls | I. Verbauwhede | L. Batina | N. Mentens | T. Kerins
[1] Johannes Wolkerstorfer. Scaling ECC Hardware to a Minimum , 2005 .
[2] Tatsuaki Okamoto,et al. Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes , 1992, CRYPTO.
[3] Sandra Dominikus,et al. Strong Authentication for RFID Systems Using the AES Algorithm , 2004, CHES.
[4] Arjen K. Lenstra,et al. Selecting Cryptographic Key Sizes , 2000, Journal of Cryptology.
[5] Dieter Gollmann,et al. Algorithm engineering for public key algorithms , 1989, IEEE J. Sel. Areas Commun..
[6] C. P. Schnorr,et al. Efficient Identification and Signatures for Smart Cards (Abstract) , 1989, EUROCRYPT.
[7] K. Itoh. Low-voltage embedded RAMs in the nanometer era , 2005, 2005 International Conference on Integrated Circuit Design and Technology, 2005. ICICDT 2005..
[8] Toru Akishita,et al. Fast Simultaneous Scalar Multiplication on Elliptic Curve with Montgomery Form , 2001, Selected Areas in Cryptography.
[9] Ari Juels,et al. Strengthening EPC tags against cloning , 2005, WiSe '05.
[10] Marten van Dijk,et al. A technique to build a secret key in integrated circuits for identification and authentication applications , 2004, 2004 Symposium on VLSI Circuits. Digest of Technical Papers (IEEE Cat. No.04CH37525).
[11] D. Bernstein. Differential addition chains , 2006 .
[12] Berk Sunar,et al. State of the art in ultra-low power public key cryptography for wireless sensor networks , 2005, Third IEEE International Conference on Pervasive Computing and Communications Workshops.
[13] P. L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization , 1987 .
[14] Ricardo Dahab,et al. Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation , 1999, CHES.
[15] Lejla Batina,et al. RFID-Tags for Anti-counterfeiting , 2006, CT-RSA.
[16] Bodo Möller. Algorithms for Multi-exponentiation , 2001, Selected Areas in Cryptography.
[17] Máire O'Neill,et al. Public Key Cryptography and RFID Tags , 2007, CT-RSA.
[18] Berk Sunar,et al. Public Key Cryptography in Sensor Networks - Revisited , 2004, ESAS.
[19] Gregory Neven,et al. Provably Secure Identity-Based Identification Schemes and Transitive Signatures , 2004 .
[20] Frédéric Thiesse,et al. Extending the EPC network: the potential of RFID in anti-counterfeiting , 2005, SAC '05.
[21] Matthew J. B. Robshaw,et al. An Active Attack Against HB +-A Provably Secure Lightweight Authentication Protocol , 2022 .
[22] Srinivas Devadas,et al. Silicon physical random functions , 2002, CCS '02.
[23] Matthew Green,et al. Security Analysis of a Cryptographically-Enabled RFID Device , 2005, USENIX Security Symposium.
[24] D. Chudnovsky,et al. Sequences of numbers generated by addition in formal groups and new primality and factorization tests , 1986 .
[25] Keshab K. Parhi,et al. Low-Energy Digit-Serial/Parallel Finite Field Multipliers , 1998 .
[26] Thomas Beth,et al. Efficient Zero-Knowledge Identification Scheme for Smart Cards , 1988, EUROCRYPT.
[27] Chanathip Namprempre,et al. Security Proofs for Identity-Based Identification and Signature Schemes , 2008, Journal of Cryptology.
[28] Ari Juels,et al. Authenticating Pervasive Devices with Human Protocols , 2005, CRYPTO.
[29] Alfred Menezes,et al. Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.
[30] Masashi Horiguchi,et al. Review and future prospects of low-voltage RAM circuits , 2003, IBM J. Res. Dev..
[31] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .
[32] S. Devadas,et al. PUF-Based Random Number Generation , 2004 .