@inproceedings{tmhd1,
  title={Two-metric helper data for highly robust and secure delay PUFs},
  author={Danger, Jean-Luc and Guilley, Sylvain and Schaub, Alexander},
  booktitle={2019 IEEE 8th International Workshop on Advances in Sensors and Interfaces (IWASI)},
  pages={184--188},
  year={2019},
  organization={IEEE}
}

@inproceedings{tmhd2,
  title={Analysis and protection of the two-metric helper data scheme},
  author={Tebelmann, Lars and K{\"u}hne, Ulrich and Danger, Jean-Luc and Pehl, Michael},
  booktitle={International Workshop on Constructive Side-Channel Analysis and Secure Design},
  pages={279--302},
  year={2021},
  organization={Springer}
}

@article{smhd,
  title={Helper Data Schemes for Coded Modulation and Shaping in Physical Unclonable Functions},
  author={Fischer, Robert FH},
  journal={arXiv preprint arXiv:2402.18980},
  year={2024}
}

@book{dekking2005modern,
  title={A Modern Introduction to Probability and Statistics: Understanding why and how},
  author={Dekking, Frederik Michel},
  year={2005},
  publisher={Springer Science \& Business Media}
}

@inproceedings{dataset,
  title={Large scale RO PUF analysis over slice type, evaluation time and temperature on 28nm Xilinx FPGAs},
  author={Hesselbarth, Robert and Wilde, Florian and Gu, Chongyan and Hanley, Neil},
  booktitle={2018 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)},
  pages={126--133},
  year={2018},
  organization={IEEE}
}

@book{schmutz,
  title={Introduction to mathematical statistics},
  author={Hogg, Robert V and McKean, Joseph W and Craig, Allen T and others},
  year={2013},
  publisher={Pearson Education India}
}

@inproceedings{PUFIntro,
  title={Introduction to physically unclonable fuctions: Properties and applications},
  author={Garcia-Bosque, Miguel and D{\'\i}ez-Se{\~n}orans, Guillermo and S{\'a}nchez-Azqueta, Carlos and Celma, Santiago},
  booktitle={2020 European Conference on Circuit Theory and Design (ECCTD)},
  pages={1--4},
  year={2020},
  organization={IEEE}
}

@article{PUFChartRef,
  title={Variable-length bit mapping and error-correcting codes for higher-order alphabet pufs—extended version},
  author={Immler, Vincent and Hiller, Matthias and Liu, Qinzhi and Lenz, Andreas and Wachter-Zeh, Antonia},
  journal={Journal of Hardware and Systems Security},
  volume={3},
  pages={78--93},
  year={2019},
  publisher={Springer}
}


@article{PUFIntro2,
  title={Physically Unclonable Functions: Constructions, Properties and Applications (Fysisch onkloonbare functies: constructies, eigenschappen en toepassingen)},
  author={Maes, Roel},
  year={2012}
}

@inproceedings{fuzzycommitmentpaper,
  title={Achieving secure fuzzy commitment scheme for optical pufs},
  author={Ignatenko, Tanya and Willems, Frans},
  booktitle={2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing},
  pages={1185--1188},
  year={2009},
  organization={IEEE}
}

@article{ruchti2021decoder,
  title={When the Decoder Has to Look Twice: Glitching a PUF Error Correction},
  author={Ruchti, Jonas and Gruber, Michael and Pehl, Michael},
  journal={Cryptology ePrint Archive},
  year={2021}
}

@article{delvaux2014helper,
  title={Helper data algorithms for PUF-based key generation: Overview and analysis},
  author={Delvaux, Jeroen and Gu, Dawu and Schellekens, Dries and Verbauwhede, Ingrid},
  journal={IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
  volume={34},
  number={6},
  pages={889--902},
  year={2014},
  publisher={IEEE}
}

@inproceedings{maes2009soft,
  title={A soft decision helper data algorithm for SRAM PUFs},
  author={Maes, Roel and Tuyls, Pim and Verbauwhede, Ingrid},
  booktitle={2009 IEEE international symposium on information theory},
  pages={2101--2105},
  year={2009},
  organization={IEEE}
}


@inproceedings{bezdek_notes_2002,
	address = {Berlin, Heidelberg},
	title = {Some {Notes} on {Alternating} {Optimization}},
	isbn = {978-3-540-45631-5},
	doi = {10.1007/3-540-45631-7_39},
	abstract = {Let f : ℜs ↦ ℜ be a real-valued scalar field, and let x = (x1,…, xs)T ∈ ℜs be partitioned into t subsets of non-overlapping variables as x = (X1,…,Xt )T, with Xi ∈ ℜp1, for i = 1,…, t, ∈ti=1pi = s Alternating optimization (AO) is an iterative procedure for minimizing (or maximizing) the function f(x) = f(X1,X2,…,Xt) jointly over all variables by alternating restricted minimizations over the individual subsets of variables X1,…,Xt. AO is the basis for the c-means clustering algorithms (t=2), many forms of vector quantization (t = 2, 3 and 4), and the expectation-maximization (EM) algorithm (t = 4) for normal mixture decomposition. First we review where and how AO fits into the overall optimization landscape. Then we discuss the important theoretical issues connected with the AO approach. Finally, we state (without proofs) two new theorems that give very general local and global convergence and rate of convergence results which hold for all partitionings of x.},
	language = {en},
	booktitle = {Advances in {Soft} {Computing} — {AFSS} 2002},
	publisher = {Springer},
	author = {Bezdek, James C. and Hathaway, Richard J.},
	editor = {Pal, Nikhil R. and Sugeno, Michio},
	year = {2002},
	pages = {288--300},
	file = {Bezdek and Hathaway - 2002 - Some Notes on Alternating Optimization.pdf:/home/mya/Zotero/storage/35MSSAAJ/Bezdek and Hathaway - 2002 - Some Notes on Alternating Optimization.pdf:application/pdf},
}

@phdthesis{janis_heims_checking_2024,
	title = {Checking of {Quantum} {Circuits} using {Diff} {Algorithms}},
	url = {https://github.com/TechnoElf/mqt-qcec-diff-thesis},
	language = {en},
	school = {Technical University of Munich},
	author = {{Janis Heims}},
	month = oct,
	year = {2024},
	file = {Janis Heims - 2024 - Checking of Quantum Circuits using Diff Algorithms.pdf:/home/mya/Zotero/storage/BKU9ANZH/Janis Heims - 2024 - Checking of Quantum Circuits using Diff Algorithms.pdf:application/pdf},
}

@article{dave_fuzzy_1990,
	title = {Fuzzy {Shell}-{Clustering} and {Applications} to {Circle} {Detection} in {Digital} {Images}},
	volume = {16},
	issn = {0308-1079},
	url = {https://doi.org/10.1080/03081079008935087},
	doi = {10.1080/03081079008935087},
	abstract = {A new type of Fuzzy Clustering algorithm called Fuzzy-Shell Clustering (FSC) is introduced, The FSC algorithm seeks cluster prototypes that are p-dimensional hyper-spherical-shells. In two-dimensional data, this amounts to finding cluster prototypes that are circles. Thus the FSC algorithm can be applied for detection of circles in digital images. The algorithm does not require the data-points to be in any particular order, therefore its performance can be compared with the global transformation techniques such as Hough transforms. Several numerical examples are considered and the performance of the FSC algorithm is compared to the performance of the methods based on generalized Hough transform (HT). The FSC is shown to be superior to the HT method with regards to memory requirement and computation time. Like the HT method, the FSC is successful even if only a part of a circular shape is present in the image. Other potential applications of FSC are also considered.},
	number = {4},
	urldate = {2024-10-07},
	journal = {International Journal of General Systems},
	author = {DAVE, RAJESH N.},
	month = may,
	year = {1990},
	note = {Publisher: Taylor \& Francis
\_eprint: https://doi.org/10.1080/03081079008935087},
	pages = {343--355},
	file = {Full Text PDF:/home/mya/Zotero/storage/APPNGAIZ/DAVE - 1990 - Fuzzy Shell-Clustering and Applications to Circle .pdf:application/pdf},
}

@article{al-nimr_international_nodate,
	title = {{THE} {INTERNATIONAL} {ADVISORY} {BOARD}},
	abstract = {A self-contained abstract outlining in a single paragraph the aims, scope and conclusions of the paper must be supplied.},
	language = {en},
	author = {Al-Nimr, Moh'd A},
	file = {Al-Nimr - THE INTERNATIONAL ADVISORY BOARD.pdf:/home/mya/Zotero/storage/IML5EJ2I/Al-Nimr - THE INTERNATIONAL ADVISORY BOARD.pdf:application/pdf},
}

@article{do_what_2008,
	title = {What is the expectation maximization algorithm?},
	volume = {26},
	copyright = {2008 Springer Nature America, Inc.},
	issn = {1546-1696},
	url = {https://www.nature.com/articles/nbt1406},
	doi = {10.1038/nbt1406},
	abstract = {The expectation maximization algorithm arises in many computational biology applications that involve probabilistic models. What is it good for, and how does it work?},
	language = {en},
	number = {8},
	urldate = {2024-10-07},
	journal = {Nature Biotechnology},
	author = {Do, Chuong B. and Batzoglou, Serafim},
	month = aug,
	year = {2008},
	note = {Publisher: Nature Publishing Group},
	keywords = {Agriculture, Bioinformatics, Biomedical Engineering/Biotechnology, Biomedicine, Biotechnology, general, Life Sciences},
	pages = {897--899},
	file = {Full Text PDF:/home/mya/Zotero/storage/H4DCQ3TP/Do and Batzoglou - 2008 - What is the expectation maximization algorithm.pdf:application/pdf},
}
