[1] R. C. Merkle, “A Digital Signature Based on a Conventional Encryption Function,” in Advances in Cryptology — CRYPTO ’87, vol. 293, C. Pomerance, Ed., in Lecture Notes in Computer Science, vol. 293. , Berlin, Heidelberg: Springer Berlin Heidelberg, 1988, pp. 369–378. doi: 10.1007/3-540-48184-2_32.
[2] C. E. Shannon, “A Mathematical Theory of Communication,” Bell System Technical Journal, vol. 27, no. 3, pp. 379–423, Jul. 1948, doi: 10.1002/j.1538-7305.1948.tb01338.x.
[3] L. E. Bassham et al., “A statistical test suite for random and pseudorandom number generators for cryptographic applications,” National Institute of Standards and Technology, Gaithersburg, MD, NIST SP 800-22r1a, 2010. doi: 10.6028/NIST.SP.800-22r1a.
[4] N. Otsu, “A Threshold Selection Method from Gray-Level Histograms,” IEEE Trans. Syst., Man, Cybern., vol. 9, no. 1, pp. 62–66, Jan. 1979, doi: 10.1109/TSMC.1979.4310076.
[5] National Institute of Standards and Technology (US), “Advanced Encryption Standard (AES),” National Institute of Standards and Technology (U.S.), Washington, D.C., error:  197, 2001. doi: 10.6028/NIST.FIPS.197.
[6] B. Moon, H. V. Jagadish, C. Faloutsos, and J. H. Saltz, “Analysis of the clustering properties of the Hilbert space-filling curve,” IEEE Trans. Knowl. Data Eng., vol. 13, no. 1, pp. 124–141, Feb. 2001, doi: 10.1109/69.908985.
[7] A. Biryukov, D. Dinu, and D. Khovratovich, “Argon2: New Generation of Memory-Hard Functions for Password Hashing and Other Applications,” in 2016 IEEE European Symposium on Security and Privacy (EuroS&P), Saarbrucken: IEEE, Mar. 2016, pp. 292–302. doi: 10.1109/EuroSP.2016.31.
[8] C. R. Harris et al., “Array programming with NumPy,” Nature, vol. 585, no. 7825, pp. 357–362, Sep. 2020, doi: 10.1038/s41586-020-2649-2.
[9] D. Boneh, H. Corrigan-Gibbs, and S. Schechter, “Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks,” in Advances in Cryptology – ASIACRYPT 2016, vol. 10031, J. H. Cheon and T. Takagi, Eds., in Lecture Notes in Computer Science, vol. 10031. , Berlin, Heidelberg: Springer Berlin Heidelberg, 2016, pp. 220–248. doi: 10.1007/978-3-662-53887-6_8.
[10] U. Uludag, S. Pankanti, S. Prabhakar, and A. K. Jain, “Biometric cryptosystems: issues and challenges,” Proc. IEEE, vol. 92, no. 6, pp. 948–960, Jun. 2004, doi: 10.1109/JPROC.2004.827372.
[11] J.-P. Aumasson, S. Neves, Z. Wilcox-O’Hearn, and C. Winnerlein, “BLAKE2: Simpler, Smaller, Fast as MD5,” in Applied Cryptography and Network Security, vol. 7954, M. Jacobson, M. Locasto, P. Mohassel, and R. Safavi-Naini, Eds., in Lecture Notes in Computer Science, vol. 7954. , Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 119–135. doi: 10.1007/978-3-642-38980-1_8.
[12] J. Considine, L. A. Levin, and D. Metcalf, “Byzantine Agreement with Faulty Majority using Bounded Broadcast,” 2000, doi: 10.48550/ARXIV.CS/0012024.
[13] Y. Nir and A. Langley, “ChaCha20 and Poly1305 for IETF Protocols,” RFC Editor, RFC7539, May 2015. doi: 10.17487/RFC7539.
[14] M. Harrower and C. A. Brewer, “ColorBrewer.org: An Online Tool for Selecting Colour Schemes for Maps,” The Cartographic Journal, vol. 40, no. 1, pp. 27–37, Jun. 2003, doi: 10.1179/000870403235002042.
[15] Feng Hao, R. Anderson, and J. Daugman, “Combining Crypto with Biometrics Effectively,” IEEE Trans. Comput., vol. 55, no. 9, pp. 1081–1088, Sep. 2006, doi: 10.1109/TC.2006.138.
[16] C. E. Shannon, “Communication Theory of Secrecy Systems*,” Bell System Technical Journal, vol. 28, no. 4, pp. 656–715, Oct. 1949, doi: 10.1002/j.1538-7305.1949.tb00928.x.
[17] L. Dorrendorf, Z. Gutterman, and B. Pinkas, “Cryptanalysis of the random number generator of the Windows operating system,” ACM Trans. Inf. Syst. Secur., vol. 13, no. 1, pp. 1–32, Oct. 2009, doi: 10.1145/1609956.1609966.
[18] H. Krawczyk, “Cryptographic Extraction and Key Derivation: The HKDF Scheme,” in Advances in Cryptology – CRYPTO 2010, vol. 6223, T. Rabin, Ed., in Lecture Notes in Computer Science, vol. 6223. , Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 631–648. doi: 10.1007/978-3-642-14623-7_34.
[19] J. Fridrich, M. Goljan, and Rui Du, “Detecting LSB steganography in color, and gray-scale images,” IEEE Multimedia, vol. 8, no. 4, pp. 22–28, Dec. 2001, doi: 10.1109/93.959097.
[20] G. Goos, J. Hartmanis, J. Van Leeuwen, P. Kocher, J. Jaffe, and B. Jun, “Differential Power Analysis,” in Advances in Cryptology — CRYPTO’ 99, vol. 1666, M. Wiener, Ed., in Lecture Notes in Computer Science, vol. 1666. , Berlin, Heidelberg: Springer Berlin Heidelberg, 1999, pp. 388–397. doi: 10.1007/3-540-48405-1_25.
[21] R. C. Gonzalez, R. E. Woods, and B. R. Masters, “Digital Image Processing, Third Edition,” J. Biomed. Opt., vol. 14, no. 2, p. 029901, 2009, doi: 10.1117/1.3115362.
[22] D. G. Lowe, “Distinctive Image Features from Scale-Invariant Keypoints,” International Journal of Computer Vision, vol. 60, no. 2, pp. 91–110, Nov. 2004, doi: 10.1023/B:VISI.0000029664.99615.94.
[23] D. J. Bernstein, T. Lange, and R. Niederhagen, “Dual EC: A Standardized Back Door,” in The New Codebreakers, vol. 9100, P. Y. A. Ryan, D. Naccache, and J.-J. Quisquater, Eds., in Lecture Notes in Computer Science, vol. 9100. , Berlin, Heidelberg: Springer Berlin Heidelberg, 2016, pp. 256–281. doi: 10.1007/978-3-662-49301-4_17.
[24] S. Josefsson and I. Liusvaara, “Edwards-Curve Digital Signature Algorithm (EdDSA),” RFC Editor, RFC8032, Jan. 2017. doi: 10.17487/RFC8032.
[25] J. Alwen and J. Blocki, “Efficiently Computing Data-Independent Memory-Hard Functions,” in Advances in Cryptology – CRYPTO 2016, vol. 9815, M. Robshaw and J. Katz, Eds., in Lecture Notes in Computer Science, vol. 9815. , Berlin, Heidelberg: Springer Berlin Heidelberg, 2016, pp. 241–271. doi: 10.1007/978-3-662-53008-5_9.
[26] T. M. Cover and J. A. Thomas, Elements of Information Theory, 1st ed. Wiley, 2005. doi: 10.1002/047174882X.
[27] N. K. Ratha, J. H. Connell, and R. M. Bolle, “Enhancing security and privacy in biometrics-based authentication systems,” IBM Syst. J., vol. 40, no. 3, pp. 614–634, 2001, doi: 10.1147/sj.403.0614.
[28] R. W. Hamming, “Error Detecting and Error Correcting Codes,” Bell System Technical Journal, vol. 29, no. 2, pp. 147–160, Apr. 1950, doi: 10.1002/j.1538-7305.1950.tb00463.x.
[29] K. Falconer, Fractal Geometry: Mathematical Foundations and Applications, 1st ed. Wiley, 2003. doi: 10.1002/0470013850.
[30] Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith, “Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data,” SIAM J. Comput., vol. 38, no. 1, pp. 97–139, Jan. 2008, doi: 10.1137/060651380.
[31] Y. Dodis, L. Reyzin, and A. Smith, “Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data,” in Advances in Cryptology - EUROCRYPT 2004, vol. 3027, C. Cachin and J. L. Camenisch, Eds., in Lecture Notes in Computer Science, vol. 3027. , Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 523–540. doi: 10.1007/978-3-540-24676-3_31.
[32] A. J. Menezes, P. C. Van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography, 1st ed. CRC Press, 2018. doi: 10.1201/9780429466335.
[33] H. Krawczyk and P. Eronen, “HMAC-based Extract-and-Expand Key Derivation Function (HKDF),” RFC Editor, RFC5869, May 2010. doi: 10.17487/rfc5869.
[34] T. Ristenpart and P. Rogaway, “How to Enrich the Message Space of a Cipher,” in Fast Software Encryption, vol. 4593, A. Biryukov, Ed., in Lecture Notes in Computer Science, vol. 4593. , Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 101–118. doi: 10.1007/978-3-540-74619-5_7.
[35] J. Fridrich, “Image encryption based on chaotic maps,” in 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, Orlando, FL, USA: IEEE, 1997, pp. 1105–1110. doi: 10.1109/ICSMC.1997.638097.
[36] G. Ye, “Image scrambling encryption algorithm of pixel bit based on chaos map,” Pattern Recognition Letters, vol. 31, no. 5, pp. 347–354, Apr. 2010, doi: 10.1016/j.patrec.2009.11.008.
[37] G. Bertoni, J. Daemen, M. Peeters, and G. Van Assche, “Keccak,” in Advances in Cryptology – EUROCRYPT 2013, vol. 7881, T. Johansson and P. Q. Nguyen, Eds., in Lecture Notes in Computer Science, vol. 7881. , Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 313–314. doi: 10.1007/978-3-642-38348-9_19.
[38] M. Bellare, R. Canetti, and H. Krawczyk, “Keying Hash Functions for Message Authentication,” in Advances in Cryptology — CRYPTO ’96, vol. 1109, N. Koblitz, Ed., in Lecture Notes in Computer Science, vol. 1109. , Berlin, Heidelberg: Springer Berlin Heidelberg, 1996, pp. 1–15. doi: 10.1007/3-540-68697-5_1.
[39] C. Beierle et al., “Lightweight AEAD and Hashing using the Sparkle Permutation Family,” ToSC, pp. 208–261, Jun. 2020, doi: 10.46586/tosc.v2020.iS1.208-261.
[40] J. D. Hunter, “Matplotlib: A 2D Graphics Environment,” Comput. Sci. Eng., vol. 9, no. 3, pp. 90–95, 2007, doi: 10.1109/MCSE.2007.55.
[41] B. Preneel and P. C. Van Oorschot, “MDx-MAC and Building Fast MACs from Hash Functions,” in Advances in Cryptology — CRYPT0’ 95, vol. 963, D. Coppersmith, Ed., in Lecture Notes in Computer Science, vol. 963. , Berlin, Heidelberg: Springer Berlin Heidelberg, 1995, pp. 1–14. doi: 10.1007/3-540-44750-4_1.
[42] A. Benito, E. Faber, and K. E. Smith, “Measuring Singularities with Frobenius: The Basics,” 2013, arXiv. doi: 10.48550/ARXIV.1309.4814.
[43] National Institute of Standards and Technology (US), “Module-lattice-based key-encapsulation mechanism standard,” National Institute of Standards and Technology (U.S.), Washington, D.C., NIST FIPS 203, Aug. 2024. doi: 10.6028/NIST.FIPS.203.
[44] D. L. Hoang, T. L. Tran, and V. L. Nguyen, “New proofs for pseudorandomness of HMAC-based key derivation functions (RFC 5869),” Journal of Information Security and Applications, vol. 93, p. 104179, Sep. 2025, doi: 10.1016/j.jisa.2025.104179.
[45] D. J. Bernstein and T. Lange, “Non-uniform Cracks in the Concrete: The Power of Free Precomputation,” in Advances in Cryptology - ASIACRYPT 2013, vol. 8270, K. Sako and P. Sarkar, Eds., in Lecture Notes in Computer Science, vol. 8270. , Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 321–340. doi: 10.1007/978-3-642-42045-0_17.
[46] P. Rogaway, “Nonce-Based Symmetric Encryption,” in Fast Software Encryption, vol. 3017, B. Roy and W. Meier, Eds., in Lecture Notes in Computer Science, vol. 3017. , Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 348–358. doi: 10.1007/978-3-540-25937-4_22.
[47] J. Blocki and S. Zhou, “On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i,” in Theory of Cryptography, vol. 10677, Y. Kalai and L. Reyzin, Eds., in Lecture Notes in Computer Science, vol. 10677. , Cham: Springer International Publishing, 2017, pp. 445–465. doi: 10.1007/978-3-319-70500-2_15.
[48] A. F. Webster and S. E. Tavares, “On the Design of S-Boxes,” in Advances in Cryptology — CRYPTO ’85 Proceedings, vol. 218, H. C. Williams, Ed., in Lecture Notes in Computer Science, vol. 218. , Berlin, Heidelberg: Springer Berlin Heidelberg, 1986, pp. 523–534. doi: 10.1007/3-540-39799-X_41.
[49] S. Li, G. Chen, and X. Mou, “ON THE DYNAMICAL DEGRADATION OF DIGITAL PIECEWISE LINEAR CHAOTIC MAPS,” Int. J. Bifurcation Chaos, vol. 15, no. 10, pp. 3119–3151, Oct. 2005, doi: 10.1142/S0218127405014052.
[50] H. Martin, P. Martin-Holgado, P. Peris-Lopez, Y. Morilla, and L. Entrena, “On the Entropy of Oscillator-Based True Random Number Generators under Ionizing Radiation,” Entropy, vol. 20, no. 7, p. 513, Jul. 2018, doi: 10.3390/e20070513.
[51] G. Bertoni, J. Daemen, M. Peeters, and G. Van Assche, “On the Indifferentiability of the Sponge Construction,” in Advances in Cryptology – EUROCRYPT 2008, vol. 4965, N. Smart, Ed., in Lecture Notes in Computer Science, vol. 4965. , Berlin, Heidelberg: Springer Berlin Heidelberg, 2008, pp. 181–197. doi: 10.1007/978-3-540-78967-3_11.
[52] H. M. Hussain, A. Ahmad, A. Narayanan, P. H. J. Nardelli, and Y. Yang, “Packetized Energy Management Controller for Residential Consumers,” 2021, arXiv. doi: 10.48550/ARXIV.2108.08535.
[53] H. M. Hussain, A. Ahmad, A. Narayanan, P. H. J. Nardelli, and Y. Yang, “Packetized Energy Management Controller for Residential Consumers,” 2021, arXiv. doi: 10.48550/ARXIV.2108.08535.
[54] L. Lamport, “Password authentication with insecure communication,” Commun. ACM, vol. 24, no. 11, pp. 770–772, Nov. 1981, doi: 10.1145/358790.358797.
[55] Wiredfool et al., Pillow: 3.1.0. (Jan. 04, 2016). Zenodo. doi: 10.5281/ZENODO.44297.
[56] B. Kaliski, J. Jonsson, and A. Rusch, “PKCS #1: RSA Cryptography Specifications Version 2.2,” RFC Editor, RFC8017, Nov. 2016. doi: 10.17487/RFC8017.
[57] B. Kaliski, “PKCS #5: Password-Based Cryptography Specification Version 2.0,” RFC Editor, RFC2898, Sep. 2000. doi: 10.17487/rfc2898.
[58] D. J. Bernstein and T. Lange, “Post-quantum cryptography,” Nature, vol. 549, no. 7671, pp. 188–194, Sep. 2017, doi: 10.1038/nature23461.
[59] R. Impagliazzo, L. A. Levin, and M. Luby, “Pseudo-random generation from one-way functions,” in Proceedings of the twenty-first annual ACM symposium on Theory of computing  - STOC ’89, Seattle, Washington, United States: ACM Press, 1989, pp. 12–24. doi: 10.1145/73007.73009.
[60] D. Boneh and M. Zhandry, “Quantum-Secure Message Authentication Codes,” in Advances in Cryptology – EUROCRYPT 2013, vol. 7881, T. Johansson and P. Q. Nguyen, Eds., in Lecture Notes in Computer Science, vol. 7881. , Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 592–608. doi: 10.1007/978-3-642-38348-9_35.
[61] M. Bellare and P. Rogaway, “Random oracles are practical: a paradigm for designing efficient protocols,” in Proceedings of the 1st ACM conference on Computer and communications security  - CCS ’93, Fairfax, Virginia, United States: ACM Press, 1993, pp. 62–73. doi: 10.1145/168588.168596.
[62] M. J. Dworkin, “Recommendation for block cipher modes of operation : GaloisCounter Mode (GCM) and GMAC,” National Institute of Standards and Technology, Gaithersburg, MD, NIST SP 800-38d, 2007. doi: 10.6028/NIST.SP.800-38d.
[63] E. Barker, “Recommendation for key management: part 1 - general,” National Institute of Standards and Technology, Gaithersburg, MD, NIST SP 800-57pt1r5, May 2020. doi: 10.6028/NIST.SP.800-57pt1r5.
[64] E. B. Barker and J. M. Kelsey, “Recommendation for Random Number Generation Using Deterministic Random Bit Generators,” National Institute of Standards and Technology, NIST SP 800-90Ar1, Jun. 2015. doi: 10.6028/NIST.SP.800-90Ar1.
[65] A. Swaminathan, Yinian Mao, and Min Wu, “Robust and secure image hashing,” IEEE Trans.Inform.Forensic Secur., vol. 1, no. 2, pp. 215–230, Jun. 2006, doi: 10.1109/TIFS.2006.873601.
[66] P. Virtanen et al., “SciPy 1.0: fundamental algorithms for scientific computing in Python,” Nat Methods, vol. 17, no. 3, pp. 261–272, Mar. 2020, doi: 10.1038/s41592-019-0686-2.
[67] National Institute of Standards and Technology (US), “SHA-3 standard : permutation-based hash and extendable-output functions,” National Institute of Standards and Technology (U.S.), Washington, D.C., error:  202, 2015. doi: 10.6028/NIST.FIPS.202.
[68] H. Sagan, Space-Filling Curves. in Universitext. New York, NY: Springer New York, 1994. doi: 10.1007/978-1-4612-0871-6.
[69] G. Alagic et al., “Status report on the third round of the NIST Post-Quantum Cryptography Standardization process,” National Institute of Standards and Technology (U.S.), Gaithersburg, MD, NIST IR 8413-upd1, Sep. 2022. doi: 10.6028/NIST.IR.8413-upd1.
[70] J. Alwen, J. Blocki, and K. Pietrzak, “Sustained Space Complexity,” in Advances in Cryptology – EUROCRYPT 2018, vol. 10821, J. B. Nielsen and V. Rijmen, Eds., in Lecture Notes in Computer Science, vol. 10821. , Cham: Springer International Publishing, 2018, pp. 99–130. doi: 10.1007/978-3-319-78375-8_4.
[71] P. L’Ecuyer and R. Simard, “TestU01: A C library for empirical testing of random number generators,” ACM Trans. Math. Softw., vol. 33, no. 4, pp. 1–40, Aug. 2007, doi: 10.1145/1268776.1268777.
[72] H. Corrigan-Gibbs and D. Kogan, “The Function-Inversion Problem: Barriers and Opportunities,” in Theory of Cryptography, vol. 11891, D. Hofheinz and A. Rosen, Eds., in Lecture Notes in Computer Science, vol. 11891. , Cham: Springer International Publishing, 2019, pp. 393–421. doi: 10.1007/978-3-030-36030-6_16.
[73] The Grammar of Graphics. in Statistics and Computing. New York: Springer-Verlag, 2005. doi: 10.1007/0-387-28695-0.
[74] M. Bellare and B. Tackmann, “The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3,” in Advances in Cryptology – CRYPTO 2016, vol. 9814, M. Robshaw and J. Katz, Eds., in Lecture Notes in Computer Science, vol. 9814. , Berlin, Heidelberg: Springer Berlin Heidelberg, 2016, pp. 247–276. doi: 10.1007/978-3-662-53018-4_10.
[75] C. Percival and S. Josefsson, “The scrypt Password-Based Key Derivation Function,” RFC Editor, RFC7914, Aug. 2016. doi: 10.17487/RFC7914.
[76] D. A. McGrew and J. Viega, “The Security and Performance of the Galois/Counter Mode (GCM) of Operation,” in Progress in Cryptology - INDOCRYPT 2004, vol. 3348, A. Canteaut and K. Viswanathan, Eds., in Lecture Notes in Computer Science, vol. 3348. , Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 343–355. doi: 10.1007/978-3-540-30556-9_27.
[77] G. J. Milburn, “The thermodynamics of clocks,” 2020, doi: 10.48550/ARXIV.2007.02217.
[78] P. C. Kocher, “Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems,” in Advances in Cryptology — CRYPTO ’96, vol. 1109, N. Koblitz, Ed., in Lecture Notes in Computer Science, vol. 1109. , Berlin, Heidelberg: Springer Berlin Heidelberg, 1996, pp. 104–113. doi: 10.1007/3-540-68697-5_9.
[79] V. Matyas and Z. Riha, “Toward reliable user authentication through biometrics,” IEEE Secur. Privacy, vol. 1, no. 3, pp. 45–49, May 2003, doi: 10.1109/MSECP.2003.1203221.
[80] D. Hilbert, “Ueber die stetige Abbildung einer Line auf ein Fl�chenst�ck,” Math. Ann., vol. 38, no. 3, pp. 459–460, Sep. 1891, doi: 10.1007/BF01199431.
[81] F. Cao, S. C. Han, S. Long, C. Xu, and J. Poon, “Understanding Attention for Vision-and-Language Tasks,” 2022, arXiv. doi: 10.48550/ARXIV.2208.08104.
[82] R. Canetti and H. Krawczyk, “Universally Composable Notions of Key Exchange and Secure Channels,” in Advances in Cryptology — EUROCRYPT 2002, vol. 2332, L. R. Knudsen, Ed., in Lecture Notes in Computer Science, vol. 2332. , Berlin, Heidelberg: Springer Berlin Heidelberg, 2002, pp. 337–351. doi: 10.1007/3-540-46035-7_22.
[83] C. Bessiere, N. Lazaar, Y. Lebbah, and M. Maamar, “Users Constraints in Itemset Mining,” 2018, arXiv. doi: 10.48550/ARXIV.1801.00345.
[84] T. Pevný, T. Filler, and P. Bas, “Using High-Dimensional Image Models to Perform Highly Undetectable Steganography,” in Information Hiding, vol. 6387, R. Böhme, P. W. L. Fong, and R. Safavi-Naini, Eds., in Lecture Notes in Computer Science, vol. 6387. , Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 161–177. doi: 10.1007/978-3-642-16435-4_13.
[85] I. E. G. Richardson, Video Codec Design: Developing Image and Video Compression Systems, 1st ed. Wiley, 2002. doi: 10.1002/0470847832.
[86] M. Naor and A. Shamir, “Visual cryptography,” in Advances in Cryptology — EUROCRYPT’94, vol. 950, A. De Santis, Ed., in Lecture Notes in Computer Science, vol. 950. , Berlin, Heidelberg: Springer Berlin Heidelberg, 1995, pp. 1–12. doi: 10.1007/BFb0053419.
[87] G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson, “Visual Cryptography for General Access Structures,” Information and Computation, vol. 129, no. 2, pp. 86–106, Sep. 1996, doi: 10.1006/inco.1996.0076.
[88] A. Baninajjar, A. Rezine, and A. Aminifar, “VNN: Verification-Friendly Neural Networks with Hard Robustness Guarantees,” 2023, arXiv. doi: 10.48550/ARXIV.2312.09748.
[89] I.-M. Sintorn and G. Borgefors, “Weighted distance transforms for volume images digitized in elongated voxel grids,” Pattern Recognition Letters, vol. 25, no. 5, pp. 571–580, Apr. 2004, doi: 10.1016/j.patrec.2003.12.006.
[90] K. Pearson, “X. On the criterion that a given system of deviations from the probable in the case of a correlated system of variables is such that it can be reasonably supposed to have arisen from random sampling,” The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, vol. 50, no. 302, pp. 157–175, Jul. 1900, doi: 10.1080/14786440009463897.
[91] J. Kelsey, B. Schneier, and N. Ferguson, “Yarrow-160: Notes on the Design and Analysis of the Yarrow Cryptographic Pseudorandom Number Generator,” in Selected Areas in Cryptography, vol. 1758, H. Heys and C. Adams, Eds., in Lecture Notes in Computer Science, vol. 1758. , Berlin, Heidelberg: Springer Berlin Heidelberg, 2000, pp. 13–33. doi: 10.1007/3-540-46513-8_2.

