This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Tree Parity Machine Rekeying Architectures
April 2005 (vol. 54 no. 4)
pp. 421-427
The necessity of securing the communication between hardware components in embedded systems becomes increasingly important with regard to the secrecy of data and particularly its commercial use. We suggest a low-cost (i.e., small logic-area) solution for flexible security levels and short key lifetimes. The basis is an approach for symmetric key exchange using the synchronization of Tree Parity Machines. Fast successive key generation enables a key exchange within a few milliseconds, given realistic communication channels with a limited bandwidth. For demonstration, we evaluate characteristics of a standard-cell ASIC design realization as IP-core in 0.18µ-technology.

[1] R. Anderson, “Protecting Embedded Systems— The Next Ten Years (Invited Talk),” Proc. Third Int'l Workshop Cryptographic Hardware and Embedded Systems (CHES 2001), pp. 1-2, May 2001.
[2] C. Paar, “Eingebettete Sicherheit im Automobil. ESCAR— Embedded IT-Security in Cars, Cologne, Germany,” 18-19 Nov. 2003.
[3] E. Bovelander, “Smart Card Security,” State of the Art in Applied Cryptography— Course on Computer Security and Industrial Cryptography (Revised Lectures), B. Preneel and V. Rijmen, eds., Springer Verlag, June 1997.
[4] K. Vedder and F. Weikmann, “Smart Cards— Requirements, Properties, and Applications,” State of the Art in Applied Cryptography— Course on Computer Security and Industrial Cryptography (Revised Lectures), pp. 307-331, Springer Verlag, June 1997.
[5] T. Wollinger, J. Guajardo, and C. Paar, “Cryptography in Embedded Systems: An Overview (Invited Paper),” Proc. Embedded World 2003 Exhibition and Conf., pp. 735-744, Feb. 2003.
[6] F. Stajano, “Security in Pervasive Computing (Invited Talk),” Proc. First Int'l Conf. Security in Pervasive Computing (SPC 2003), p. 1, 2003.
[7] A. Kerckhoffs, “La Cryptographie Militaire,” J. des Sciences Militaries, vol. IX, pp. 5-38, Jan. 1883, pp. 161-191, Feb. 1883.
[8] A. Huang, “Keeping Secrets in Hardware: The Microsoft X-BOX™ Case Study,” Proc. Workshop Cryptographic Hardware and Embedded Systems 2002 (CHES 2002), pp. 213-227, Aug. 2003.
[9] W. Diffie and M.E. Hellman, “New Directions in Cryptography,” IEEE Trans. Information Theory, vol. 22, no. 6, pp. 644-654, Nov. 1976.
[10] T.E. Gamal, “A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms,” IEEE Trans. Information Theory, vol. 31, no. 4, pp. 469-472, 1985.
[11] R. Rivest, A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public Key Cryptosystems,” Comm. ACM, vol. 21, no. 2, pp. 120-126, Feb. 1978.
[12] Rhode & Schwarz, TopSec GSM, Data Sheet PD0757.6904.21, Aug. 2001.
[13] J. Pelzl, T. Wollinger, and C. Paar, “Low Cost Security: Explicit Formulae for Genus-4 Hyperelliptic Curves,” Proc. 10th Ann. Workshop Selected Areas in Cryptography (SAC 2003), 2003.
[14] I. Kanter, W. Kinzel, and E. Kanter, “Secure Exchange of Information by Synchronization of Neural Networks,” Europhysics Letters, vol. 57, no. 1, pp. 141-147, 2002.
[15] R. Metzler, W. Kinzel, and I. Kanter, “Interacting Neural Networks,” Physics Rev. E, vol. 62, no. 2, pp. 2555-2565, 2000.
[16] W. Kinzel and I. Kanter, “Interacting Neural Networks and Cryptography,” Advances in Solid State Physics, B. Kramer, ed., Springer Verlag, 2002.
[17] “Theory of Interacting Neural Networks,” Handbook of Graphs and Networks, S. Bornholdt and H. Schuster, eds., Wiley VCH, 2003.
[18] U. Maurer, “Secret Key Agreement by Public Discussion,” IEEE Trans. Information Theory, vol. 39, no. 3, pp. 733-742, 1993.
[19] A. Klimov, A. Mityagin, and A. Shamir, “Analysis of Neural Cryptography,” Proc. AsiaCrypt 2002, pp. 288-298, 2002.
[20] R. Mislovaty, Y. Perchenok, I. Kanter, and W. Kinzel, “Secure Key-Exchange Protocol with an Absence of Injective Functions,” Physics Rev. E, vol. 66, no. 066102, 2002.
[21] M. Rosen-Zvi, E. Klein, I. Kanter, and W. Kinzel, “Mutual Learning in a Tree Parity Machine and Its Application to Cryptography,” Physics Rev. E., vol. 66, no. 066135, 2002.
[22] I. Kanter and W. Kinzel, “Neural Cryptography,” Proc. Ninth Int'l Conf. Neural Information Processing, 2002.
[23] L.N. Shacham, E. Klein, R. Mislovaty, I. Kanter, and W. Kinzel, “Cooperating Attackers in Neural Cryptography,” Dec. 2003, preprint www.arxiv.org/cond-mat0312068.
[24] M. Abdalla and M. Bellare, “Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Rekeying Techniques,” Advances in Cryptology— Asiacrypt 2000 Proc., T. Okamoto, ed., 2000.
[25] W. Rankl and W. Effing, Smart Card Handbook. Wiley & Sons Ltd., 2000.
[26] M. Rosen-Zvi, I. Kanter, and W. Kinzel, “Cryptography Based on Neural Networks— Analytical Results,” J. Physics A: Math. Gen., vol. 35, no. 47, pp. L707-L713, 2002.
[27] A. Ruttor and W. Kinzel, “Repulsive Feedback Mechanisms in Neural Cryptography,” 2003.
[28] R. Mislovaty, E. Klein, I. Kanter, and W. Kinzel, “Public Channel Cryptography by Synchronization of Neural Networks and Chaotic Maps,” Physics Rev. Letters, vol. 91, no. 118701, 2003.
[29] A. Ruttor, W. Kinzel, L. Shacham, and I. Kanter, “Neural Cryptography with Feedback,” Physics Rev. E, vol. 69, 2004.

Index Terms:
Security, authentication, algorithms implemented in hardware, ubiquitous computing, pervasive computing.
Citation:
Markus Volkmer, Sebastian Wallner, "Tree Parity Machine Rekeying Architectures," IEEE Transactions on Computers, vol. 54, no. 4, pp. 421-427, April 2005, doi:10.1109/TC.2005.70
Usage of this product signifies your acceptance of the Terms of Use.