{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T09:40:29Z","timestamp":1736502029915,"version":"3.32.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T00:00:00Z","timestamp":1707523200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T00:00:00Z","timestamp":1707523200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comput Virol Hack Tech"],"DOI":"10.1007\/s11416-023-00511-z","type":"journal-article","created":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T10:02:41Z","timestamp":1707559361000},"page":"441-445","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An approach for designing fast public key encryption systems using white-box cryptography techniques"],"prefix":"10.1007","volume":"20","author":[{"given":"D.","family":"Schelkunov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,10]]},"reference":[{"issue":"2","key":"511_CR1","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.jco.2004.01.002","volume":"20","author":"IF Blake","year":"2004","unstructured":"Blake, I.F., Theo, G.: On the complexity of the discrete logarithm and Diffie\u2013Hellman problems. J. Complex. 20(2), 148\u2013170 (2004)","journal-title":"J. Complex."},{"key":"511_CR2","first-page":"114","volume":"44","author":"Robert J McEliece","year":"1978","unstructured":"McEliece, Robert J.: A public-key cryptosystem based on algebraic. Coding Theory DSN Progress Report 44, 114\u2013116 (1978)","journal-title":"Coding Theory DSN Progress Report"},{"key":"511_CR3","doi-asserted-by":"crossref","unstructured":"Dinh, H., Moore, C., Russell, A.: McEliece and Niederreiter cryptosystems that resist quantum Fourier sampling attacks Rogaway. In: Advances in Cryptology\u2013CRYPTO 2011. Lecture Notes in Computer Science, 6841. Springer, Berlin, pp. 761\u2013779 (2011)","DOI":"10.1007\/978-3-642-22792-9_43"},{"key":"511_CR4","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. ACM, Philadelphia, pp. 99\u2013108 (1996)","DOI":"10.1145\/237814.237838"},{"key":"511_CR5","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: The shortest vector problem in L2 is NP-hard for randomized reductions. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. ACM, Dallas, pp. 10\u201319 (1998)","DOI":"10.1145\/276698.276705"},{"issue":"1997","key":"511_CR6","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P Shor","year":"1997","unstructured":"Shor, P.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(1997), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"511_CR7","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1515\/dma.1992.2.4.439","volume":"2","author":"VM Sidelnikov","year":"1992","unstructured":"Sidelnikov, V.M., Shestakov, S.O.: On the insecurity of cryptosystems based on generalized Reed\u2013Solomon codes. Discrete Math. Appl. 2(4), 439\u2013444 (1992)","journal-title":"Discrete Math. Appl."},{"key":"511_CR8","doi-asserted-by":"crossref","unstructured":"Chow, S., Eisen, P., Johnson, H., van Oorschot, P.C.: White-box cryptography and an AES implementation. In: 9th Annual Workshop on Selected Areas in Cryptography (SAC 2002) (2002)","DOI":"10.1007\/3-540-36492-7_17"},{"key":"511_CR9","unstructured":"Wyseur, B.: White-box cryptography. Ph.D. Thesis, Katholieke Universiteit Leuven (2009)"},{"key":"511_CR10","unstructured":"Schelkunov, D.: White-Box cryptography and SPN ciphers. LRC method. Cryptology ePrint Archive: Report. 2010\/419 (2010)"},{"issue":"2","key":"511_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/81.904880","volume":"48","author":"J Goce","year":"2001","unstructured":"Goce, J., Ljupco, K.: Chaos and cryptography: block encryption ciphers based on chaotic maps. IEEE Trans. Circuits Syst. I Fundam. Theory Appl. 48(2), 163\u2013169 (2001)","journal-title":"IEEE Trans. Circuits Syst. I Fundam. Theory Appl."},{"issue":"1","key":"511_CR12","doi-asserted-by":"publisher","first-page":"170","DOI":"10.4218\/etrij.08.0207.0188","volume":"30","author":"M Asim","year":"2008","unstructured":"Asim, M., Jeoti, V.: Efficient and simple method for designing chaotic S-boxes. ETRI J. 30(1), 170\u2013172 (2008)","journal-title":"ETRI J."},{"key":"511_CR13","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"ER Berlekamp","year":"1978","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.A.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24, 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"511_CR14","doi-asserted-by":"publisher","first-page":"3426","DOI":"10.1109\/TIT.2022.3143620","volume":"68","author":"T Debris-Alazard","year":"2022","unstructured":"Debris-Alazard, T., Ducas, L., van Woerden, W.P.: An algorithmic reduction theory for binary codes: LLL and more. IEEE Trans. Inf. Theory 68(5), 3426\u20133444 (2022)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Journal of Computer Virology and Hacking Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-023-00511-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11416-023-00511-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-023-00511-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T10:09:24Z","timestamp":1736417364000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11416-023-00511-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,10]]},"references-count":14,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2024,9]]}},"alternative-id":["511"],"URL":"https:\/\/doi.org\/10.1007\/s11416-023-00511-z","relation":{},"ISSN":["2263-8733"],"issn-type":[{"type":"electronic","value":"2263-8733"}],"subject":[],"published":{"date-parts":[[2024,2,10]]},"assertion":[{"value":"27 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"I declare that there is no conflict of interest regarding the publication of this paper. I hereby declare that the information given in this disclosure is true and complete to the best of my knowledge and belief.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The author has no relevant financial or non-financial interests to disclose.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Financial or Non-financial interests"}}]}}