{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:17:19Z","timestamp":1772893039504,"version":"3.50.1"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,3,14]],"date-time":"2013-03-14T00:00:00Z","timestamp":1363219200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s13389-013-0056-4","type":"journal-article","created":{"date-parts":[[2013,3,13]],"date-time":"2013-03-13T03:43:47Z","timestamp":1363146227000},"page":"29-43","source":"Crossref","is-referenced-by-count":11,"title":["Code-based cryptography on reconfigurable hardware: tweaking Niederreiter encryption for performance"],"prefix":"10.1007","volume":"3","author":[{"given":"Stefan","family":"Heyse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"G\u00fcneysu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,14]]},"reference":[{"key":"56_CR1","doi-asserted-by":"crossref","unstructured":"Bailey, D.V., Coffin, D., Elbirt, A., Silverman, J.H., Woodbury, A.D.: NTRU in Constrained Devices. In: Cryptographic Hardware and Embedded Systems\u2014CHES 2001. LNCS, vol. 2162, pp. 262\u2013272 (2001)","DOI":"10.1007\/3-540-44709-1_22"},{"key":"56_CR2","doi-asserted-by":"crossref","unstructured":"Berger, T.P., Cayrel, P.-L., Gaborit, P., Otmani, A.: Reducing key length of the McEliece cryptosystem. In: Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology, AFRICACRYPT \u201909, pp. 77\u201397. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-02384-2_6"},{"issue":"2","key":"56_CR3","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/TIT.1968.1054109","volume":"14","author":"B Berlekamp","year":"1968","unstructured":"Berlekamp, B.: Nonbinary BCH decoding. IEEE Trans Inf Theory 14(2), 242 (1968)","journal-title":"IEEE Trans Inf Theory"},{"key":"56_CR4","doi-asserted-by":"crossref","unstructured":"Berlekamp, E.: Goppa Codes. IEEE Trans. Inf. Theory IT-19(5) (1973)","DOI":"10.1109\/TIT.1973.1055088"},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"Berlekamp, E.R.: A survey of coding theory. J. R. Stat. Soc. Ser. A (General) 135(1) (1972)","DOI":"10.2307\/2345039"},{"key":"56_CR6","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: List decoding for binary Goppa codes. In: Proceedings of the Third International Conference on Coding and Cryptology, IWCC\u201911, pp. 62\u201380. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-20901-7_4"},{"key":"56_CR7","unstructured":"Bernstein, D.J., Lange, T.: eBACS: ECRYPT Benchmarking of Cryptographic Systems (2009). http:\/\/bench.cr.yp.to"},{"key":"56_CR8","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the McEliece cryptosystem. In: Proceedings of the International Workshop on Post-Quantum Cryptography-PQCrypto \u201908. LNCS, vol. 5299, pp. 31\u201346. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-88403-3_3"},{"key":"56_CR9","unstructured":"Biswas, B., Herbert, V.: Efficient root finding of polynomials over fields of characteristic 2. In: WEWoRC 2009 (2009)"},{"key":"56_CR10","unstructured":"Biswas, B., Sendrier, N.: McEliece crypto-system: a reference implementation"},{"key":"56_CR11","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Eisenbarth, T., Rupp, A., Wolf, C.: Time-area optimized public-key engines: MQ-cryptosystems as replacement for elliptic curves? In: Proceedings of the Workshop on Cryptographic Hardware and Embedded Systems-CHES 2008, vol. 5154. LNCS, pp. 45\u201361. Springer (2008)","DOI":"10.1007\/978-3-540-85053-3_4"},{"key":"56_CR12","doi-asserted-by":"crossref","unstructured":"Bouyukliev, I.G.: About the code equivalence. World Scientific, Hackensack, pp. 126\u2013151 (2007)","DOI":"10.1142\/9789812772022_0009"},{"key":"56_CR13","unstructured":"Bras-Amors, M., O\u2019Sullivan, M.E.: The Berlekamp-Massey algorithm and the Euclidean algorithm: A closer link. In: CoRR, Vol. abs\/0908.2198 (2009)"},{"key":"56_CR14","doi-asserted-by":"crossref","unstructured":"Canteaut, A., Chabaud, F.: Improvements of the attacks on cryptosystems based on error-correcting codes (1995)","DOI":"10.1007\/BFb0053430"},{"key":"56_CR15","doi-asserted-by":"crossref","unstructured":"Cayrel, P.-L., Hoffmann, G., Persichetti, E.: Efficient implementation of a CCA2-secure variant of McEliece using generalized srivastava codes. In: Proceedings of the 15th International Conference on Practice and Theory in Public Key Cryptography, PKC\u201912, pp. 138\u2013155. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-30057-8_9"},{"key":"56_CR16","unstructured":"Chang, K.: I.B.M. Researchers Inch Toward Quantum Computer. New York Times Article (2012). http:\/\/www.nytimes.com\/2012\/02\/28\/technology\/ibm-inch-closer-on-quantum-computer.html?_r=1&hpw"},{"issue":"4","key":"56_CR17","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1109\/TIT.1964.1053699","volume":"10","author":"R Chien","year":"2006","unstructured":"Chien, R.: Cyclic decoding procedures for Bose-Chaudhuri-Hocquenghem codes. IEEE Trans. Inf. Theor. 10(4), 357\u2013363 (2006)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"56_CR18","doi-asserted-by":"crossref","unstructured":"Cover, T.: Enumerative source encoding 19(1), 73\u201377 (1973)","DOI":"10.1109\/TIT.1973.1054929"},{"key":"56_CR19","doi-asserted-by":"crossref","unstructured":"Dinh, H., Moore, C., Russell, A.: McEliece and Niederreiter cryptosystems that resist quantum fourier sampling attacks. In: Proceedings of the 31st Annual Conference on Advances in Cryptology, CRYPTO\u201911, pp. 761\u2013779. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-22792-9_43"},{"issue":"3","key":"56_CR20","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1109\/TIT.1987.1057299","volume":"33","author":"J-L Dornstetter","year":"1987","unstructured":"Dornstetter, J.-L.: On the equivalence between Berlekamp\u2019s and Euclid\u2019s algorithms. IEEE Trans. Inf. Theory 33(3), 428\u2013431 (1987)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"56_CR21","unstructured":"ECRYPT: Yearly report on algorithms and keysizes (2007\u20132008). Technical Report, D.SPA.28 Rev. 1.1, July 2008. http:\/\/www.ecrypt.eu.org\/documents\/D.SPA.10-1.1.pdf"},{"key":"56_CR22","doi-asserted-by":"crossref","unstructured":"Eisenbarth, T., G\u00fcneysu, T., Heyse, S., Paar, C.: Microeliece: McEliece for embedded devices. In: CHES \u201909: Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems, pp. 49\u201364. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-04138-9_4"},{"key":"56_CR23","first-page":"162","volume":"2006","author":"D Engelbert","year":"2006","unstructured":"Engelbert, D., Overbeck, R., Schmidt, A.: A summary of McEliece-type cryptosystems and their security. IACR Cryptol. ePrint Arch. 2006, 162 (2006)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"56_CR24","doi-asserted-by":"crossref","unstructured":"Faugere, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: Algebraic cryptanalysis of McEliece variants with compact keys (2009)","DOI":"10.1007\/978-3-642-13190-5_14"},{"key":"56_CR25","doi-asserted-by":"crossref","unstructured":"Fischer, J.-B., Stern, J.: An efficient pseudo-random generator provably as secure as syndrome decoding. In: Advances in Cryptology EUROCRYPT 96, vol. 1070. Lecture Notes in Computer Science, pp. 245\u2013255. Springer, Berlin (1996)","DOI":"10.1007\/3-540-68339-9_22"},{"key":"56_CR26","doi-asserted-by":"crossref","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: CRYPTO \u201999: Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology, pp. 537\u2013554. Springer, London (1999)","DOI":"10.1007\/3-540-48405-1_34"},{"key":"56_CR27","doi-asserted-by":"crossref","unstructured":"Ghosh, S., Delvaux, J., Uhsadel, L., Verbauwhede, I.: A speed area optimized embedded co-processor for McEliece cryptosystem. In: 2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors (ASAP), pp. 102\u2013108 (2012)","DOI":"10.1109\/ASAP.2012.16"},{"issue":"3","key":"56_CR28","first-page":"24","volume":"6","author":"V Goppa","year":"1969","unstructured":"Goppa, V.: A new class of linear correcting codes. Probl. Peredachi Inf. 6(3), 24\u201330 (1969)","journal-title":"Probl. Peredachi Inf."},{"issue":"3","key":"56_CR29","first-page":"291","volume":"3","author":"D Gorenstein","year":"1960","unstructured":"Gorenstein, D., Peterson, W.W., Zierler, N.: Two-error correcting Bose-Chaudhuri codes are quasi-perfect. Inf. Comput. 3(3), 291\u2013294 (1960)","journal-title":"Inf. Comput."},{"issue":"2","key":"56_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1371579.1371580","volume":"1","author":"T G\u00fcneysu","year":"2008","unstructured":"G\u00fcneysu, T., Paar, C., Pelzl, J.: Special-purpose hardware for solving the elliptic curve discrete logarithm problem. ACM Trans. Reconfig. Technol. Syst. (TRETS) 1(2), 1\u201321 (2008)","journal-title":"ACM Trans. Reconfig. Technol. Syst. (TRETS)"},{"key":"56_CR31","unstructured":"Helion Technology Inc.: Modular Exponentiation Core Family for Xilinx FPGA. Data Sheet, October 2008. http:\/\/www.heliontech.com\/downloads\/modexp_xilinx_datasheet.pdf"},{"key":"56_CR32","doi-asserted-by":"crossref","unstructured":"Heyse, S.: Low-Reiter: Niederreiter encryption scheme for embedded microcontrollers. In : Sendrier, N. (ed.) Post-Quantum Cryptography, Third International Workshop, PQCrypto 2010, Darmstadt, Germany, May 25\u201328, 2010. Proceedings, vol. 6061. Lecture Notes in Computer Science, pp. 165\u2013181. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-12929-2_13"},{"key":"56_CR33","doi-asserted-by":"crossref","unstructured":"Heyse, S.: Implementation of McEliece based on quasi-dyadic Goppa codes for embedded devices. In: Yang, B.-Y. (ed.) Post-Quantum Cryptography, volume 7071 of Lecture Notes in Computer Science, pp. 143\u2013162. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-25405-5_10"},{"key":"56_CR34","doi-asserted-by":"crossref","unstructured":"Heyse, S., G\u00fcneysu, T.: Towards one cycle per bit asymmetric encryption: code-based cryptography on reconfigurable hardware. In: Prouff, E., Schaumont, P. (eds.) CHES, vol. 7428. Lecture Notes in Computer Science, pp. 340\u2013355. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-33027-8_20"},{"key":"56_CR35","unstructured":"Heyse, S., Moradi, A., Paar, C.: Practical power analysis attacks on software implementations of McEliece. In: Sendrier, N. (ed.) Post-Quantum Cryptography, vol. 6061. Lecture Notes in Computer Science, pp. 108\u2013125. Springer, Berlin (2010). doi: 10.1007\/978-3-642-12929-29"},{"key":"56_CR36","unstructured":"Hoffmann, G.: Implementation of McEliece using quasi-dyadic Goppa Codes. Bachelor thesis, TU Darmstadt (2011) http:\/\/www.cdc.informatik.tu-darmstadt.de\/reports\/reports\/Gerhard_Hoffmann.bachelor.pdf"},{"key":"56_CR37","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1098\/rstl.1819.0023","volume":"109","author":"WG Horner","year":"1819","unstructured":"Horner, W.G.: A new method of solving numerical equations of all orders, by continuous approximation. Philosophical Transactions of the Royal Society of London 109, 308\u2013335 (1819)","journal-title":"Philosophical Transactions of the Royal Society of London"},{"issue":"2","key":"56_CR38","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1049\/el:19960072","volume":"32","author":"K Huber","year":"1996","unstructured":"Huber, K.: Note on decoding binary Goppa codes. Electron. Lett. 32(2), 102\u2013103 (1996)","journal-title":"Electron. Lett."},{"key":"56_CR39","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"CW Huffman","year":"2003","unstructured":"Huffman, C.W., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)"},{"key":"56_CR40","doi-asserted-by":"crossref","unstructured":"Kobara, K., Imai, H.: Semantically secure McEliece public-key cryptosystems-conversions for McEliece. In: Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography, PKC \u201901, pp. 19\u201335, London, UK. Springer, Berlin (2001)","DOI":"10.1007\/3-540-44586-2_2"},{"key":"56_CR41","unstructured":"Lee, K.: Interpolation-based decoding of alternant codes. In: CoRR, vol. abs\/cs\/0702118 (2007)"},{"issue":"1","key":"56_CR42","first-page":"271","volume":"40","author":"YX Li","year":"2006","unstructured":"Li, Y.X., Deng, R.H., wang, X.M.: On the equivalence of McEliece\u2019s and Niederreiter\u2019s public-key cryptosystems. IEEE Trans. Inf. Theor. 40(1), 271\u2013273 (2006)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"44","key":"56_CR43","first-page":"114","volume":"42","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep. 42(44), 114\u2013116 (1978)","journal-title":"DSN Prog. Rep."},{"key":"56_CR44","unstructured":"Minder, L.: Cryptography based on error correcting codes. PhD Thesis, \u00c8cole Polytechnique F\u00e9d\u00e9rale de Lausanne (2007)"},{"key":"56_CR45","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Barreto, P.S.: Compact McEliece keys from Goppa codes. In: Selected Areas in Cryptography: 16th Annual International Workshop (SAC 2009), pp. 376\u2013392. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-05445-7_24"},{"key":"56_CR46","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Barreto, P.S.: Selected areas in cryptography. In: Chapter Compact McEliece Keys from Goppa Codes, pp. 376\u2013392. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-05445-7_24"},{"key":"56_CR47","doi-asserted-by":"crossref","unstructured":"Molter, H., St\u00f6ttinger, M., Shoufan, A., Strenzke, F.: A simple power analysis attack on a mceliece cryptoprocessor. J. Cryptogr. Eng. 1(29\u201336) (2011). doi: 10.1007\/s13389-011-0001-3","DOI":"10.1007\/s13389-011-0001-3"},{"key":"56_CR48","doi-asserted-by":"crossref","unstructured":"Niebuhr, R., Cayrel, P.-L.: Broadcast attacks against code-based schemes. In: Armknecht, F., Lucks, S. (eds) WEWoRC, vol. 7242. Lecture Notes in Computer Science, pp. 1\u201317. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-34159-5_1"},{"key":"56_CR49","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Prob. Control Inf. Theory\/Problemy Upravlen. Teor Inf. 15(2), 159\u2013166 (1986)"},{"key":"56_CR50","doi-asserted-by":"crossref","unstructured":"Overbeck, R., Sendrier, N.: Code-based cryptography. In: Bernstein, Daniel J., et al. (ed.) Post-Quantum Cryptography. First International Workshop PQCrypto 2006, Leuven, The Netherland, May 23\u201326, 2006, pp. 95\u2013145. Selected Papers. Springer, Berlin (2009)","DOI":"10.1007\/978-3-540-88702-7_4"},{"key":"56_CR51","unstructured":"Patterson, N.: The algebraic decoding of Goppa codes. IEEE Trans. Inf. Theory 21(2), 203\u2013207 (1975)"},{"key":"56_CR52","first-page":"179","volume":"2011","author":"E Persichetti","year":"2011","unstructured":"Persichetti, E.: Compact McEliece keys based on Quasi-Dyadic Srivastava codes. IACR Cryptol. ePrint Arch. 2011, 179 (2011)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"4","key":"56_CR53","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1109\/TIT.1960.1057586","volume":"6","author":"W Peterson","year":"1960","unstructured":"Peterson, W.: Encoding and error-correction procedures for the Bose-Chaudhuri codes. IRE Trans. Inf. Theory 6(4), 459\u2013470 (1960)","journal-title":"IRE Trans. Inf. Theory"},{"key":"56_CR54","unstructured":"Pierre-Louis Cayrel: Code-based cryptosystems: implementations. http:\/\/www.cayrel.net\/research\/code-based-cryptography\/code-based-cryptosystems\/"},{"key":"56_CR55","doi-asserted-by":"crossref","unstructured":"Pointcheval, D.: Chosen-Ciphertext security for any one-way cryptosystem. In: Imai, H., Zheng, Y. (eds.) Workshop on Practice and Theory in Public-Key Cryptography (PKC \u201900), vol. 1751. Lecture Notes in Computer ScienceSpringer, pp. 129\u2013146. Melbourne, Australia (2000)","DOI":"10.1007\/978-3-540-46588-1_10"},{"key":"56_CR56","doi-asserted-by":"crossref","unstructured":"Sendrier, N.: Efficient generation of binary words of given weight. In: Cryptography and Coding, vol. 1025. Lecture Notes in Computer Science, pp. 184\u2013187. Springer, Berlin (1995)","DOI":"10.1007\/3-540-60693-9_20"},{"key":"56_CR57","doi-asserted-by":"crossref","unstructured":"Sendrier, N.: Encoding information into constant weight words. In: Proceedings of International Symposium on Information Theory ISIT 2005, pp. 435\u2013438 (2005)","DOI":"10.1109\/ISIT.2005.1523371"},{"issue":"5","key":"56_CR58","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"56_CR59","unstructured":"Shoufan, A., Strenzke, F., Molter, H., St\u00f6ttinger, M.: A timing attack against Patterson algorithm in the McEliece PKC. In: Lee, D., Hong, S. (eds.) Information, Security and Cryptology ICISC 2009, vol. 5984. Lecture Notes in Computer Science, pp. 161\u2013175. Springer, Berlin (2010). doi: 10.1007\/978-3-642-14423-312"},{"key":"56_CR60","doi-asserted-by":"crossref","unstructured":"Shoufan, A., Wink, T., Molter, H.G., Huss, S.A., Strenzke. F.: A Novel processor architecture for McEliece cryptosystem and FPGA platforms. In: 20th IEEE International Conference on Application-specific Systems, Architectures and Processors (2009)","DOI":"10.1109\/ASAP.2009.29"},{"key":"56_CR61","unstructured":"Strenzke, F.: A timing attack against the secret permutation in the McEliece PKC. In: Sendrier, N. (ed.) Post-Quantum Cryptography, vol. 6061. Lecture Notes in Computer Science, pp. 95\u2013107. Springer, Berlin (2010). doi: 10.1007\/978-3-642-12929-28"},{"key":"56_CR62","doi-asserted-by":"crossref","unstructured":"Strenzke, F., Tews, E., Molter, H., Overbeck, R., Shoufan, A.: Side channels in the McEliece PKC. In: 2nd workshop on post-quantum cryptography, pp. 216\u2013229. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-88403-3_15"},{"issue":"1","key":"56_CR63","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/346048.346049","volume":"31","author":"M Sudan","year":"2000","unstructured":"Sudan, M.: List decoding: algorithms and applications. SIGACT News 31(1), 16\u201327 (2000)","journal-title":"SIGACT News"},{"issue":"1","key":"56_CR64","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0019-9958(75)90090-X","volume":"27","author":"Y Sugiyama","year":"1975","unstructured":"Sugiyama, Y., Kasahara, M., Hirasawa, S., Namekawa, T.: A method for solving key equation for decoding goppa codes. Inf. Control 27(1), 87\u201399 (1975)","journal-title":"Inf. Control"},{"issue":"1","key":"56_CR65","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1109\/TIE.2012.2186104","volume":"60","author":"G Sutter","year":"2013","unstructured":"Sutter, G., Deschamps, J., Imana., J.: Efficient elliptic curve point multiplication using digit-serial binary field operations. IEEE Trans. Ind. Electron. 60(1), 217\u2013225 (2013)","journal-title":"IEEE Trans. Ind. Electron."},{"key":"56_CR66","unstructured":"Xilinx Inc.: Data Sheets and Product Information for Xilinx Spartan and Virtex FPGAs. http:\/\/www.xilinx.com\/support\/"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-013-0056-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-013-0056-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-013-0056-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T19:08:56Z","timestamp":1562785736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-013-0056-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,14]]},"references-count":66,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["56"],"URL":"https:\/\/doi.org\/10.1007\/s13389-013-0056-4","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,14]]}}}