Pim Tuyls
Research Subjects
Pim Tuyls has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Boris Skoric
Philips Research Europe
8 shared publications - Geert-Jan Schrijen
Philips Research
5 shared publications - Berry Schoenmakers
Technische Universiteit Eindhoven
4 shared publications - Frans M. J. Willems
Department of Electrical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands
3 shared publications - Jorge Guajardo
Philips Research Europe
3 shared publications - Tanya Ignatenko
Eindhoven University of Technology Eindhoven The Netherlands
3 shared publications
Latest Publications
- 23 October 2008
- Published by Springer Nature in Information Systems Frontiers
- Vol. 11 (1) , 19-41
Anti-counterfeiting, key distribution, and key storage in an ambient world via physical unclonable functions
- 23 October 2008
- Published by Springer Nature in Information Systems Frontiers
- Vol. 11 (1) , 19-41
Anti-counterfeiting, key distribution, and key storage in an ambient world via physical unclonable functions
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1946147X,p. 189-195
Physical Unclonable Functions and Public-Key Crypto for FPGA IP Protection
In recent years, IP protection of FPGA hardware designs has become a requirement for many IP vendors. To this end solutions have been proposed based on the idea of bitstream encryption, symmetric-key primitives, and the use of physical unclonable functions (PUFs). In this paper, we propose new protocols for the IP protection problem on FPGAs based on public-key (PK) cryptography, analyze the advantages and costs of such an approach, and describe a PUF intrinsic to current FPGAs based on SRAM properties. A major advantage of using PK-based protocols is that they do not require the private key stored in the FPGA to leave the device, thus increasing security. This added security comes at the cost of additional hardware resources but it does not cause significant performance degradation.
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1946147X,p. 189-195
Physical Unclonable Functions and Public-Key Crypto for FPGA IP Protection
In recent years, IP protection of FPGA hardware designs has become a requirement for many IP vendors. To this end solutions have been proposed based on the idea of bitstream encryption, symmetric-key primitives, and the use of physical unclonable functions (PUFs). In this paper, we propose new protocols for the IP protection problem on FPGAs based on public-key (PK) cryptography, analyze the advantages and costs of such an approach, and describe a PUF intrinsic to current FPGAs based on SRAM properties. A major advantage of using PK-based protocols is that they do not require the private key stored in the FPGA to leave the device, thus increasing security. This added security comes at the cost of additional hardware resources but it does not cause significant performance degradation.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 256-260
Smooth Rényi Entropy of Ergodic Quantum Information Sources
We investigate the recently introduced notion of smooth Renyi entropy for the case of ergodic information sources, thereby generalizing previous work which concentrated mainly on i.i.d. information sources. We will actually consider ergodic quantum information sources, of which ergodic classical information sources are a special case. We prove that the average smooth Renyi entropy rate will approach the entropy rate of a stationary, ergodic source, which is equal to the Shannon entropy rate for a classical source and the von Neumann entropy rate for a quantum source.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 256-260
Smooth Rényi Entropy of Ergodic Quantum Information Sources
We investigate the recently introduced notion of smooth Renyi entropy for the case of ergodic information sources, thereby generalizing previous work which concentrated mainly on i.i.d. information sources. We will actually consider ergodic quantum information sources, of which ergodic classical information sources are a special case. We prove that the average smooth Renyi entropy rate will approach the entropy rate of a stationary, ergodic source, which is equal to the Shannon entropy rate for a classical source and the von Neumann entropy rate for a quantum source.
- Open Access
Smooth Rényi Entropy of Ergodic Quantum Information Sources
We prove that the average smooth Renyi entropy rate will approach the entropy rate of a stationary, ergodic information source, which is equal to the Shannon entropy rate for a classical information source and the von Neumann entropy rate for a quantum information source.
Open AccessSmooth Rényi Entropy of Ergodic Quantum Information Sources
We prove that the average smooth Renyi entropy rate will approach the entropy rate of a stationary, ergodic information source, which is equal to the Shannon entropy rate for a classical information source and the von Neumann entropy rate for a quantum information source.
- 1 January 2007
- Published by Springer Nature
- p. 141-149
Computationally Secure Authentication with Noisy Data
- 1 January 2007
- Published by Springer Nature
- p. 141-149
Computationally Secure Authentication with Noisy Data
- 1 January 2007
- Published by Springer Nature
- p. 57-77
A Communication-Theoretical View on Secret Extraction
- 1 January 2007
- Published by Springer Nature
- p. 57-77
A Communication-Theoretical View on Secret Extraction
- 1 January 2007
- Published by Springer Nature
- p. 217-233
Entropy Estimation for Optical PUFs Based on Context-Tree Weighting Methods
- 1 January 2007
- Published by Springer Nature
- p. 217-233
Entropy Estimation for Optical PUFs Based on Context-Tree Weighting Methods