{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T20:11:32Z","timestamp":1654114292586},"reference-count":10,"publisher":"IGI Global","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,1,1]]},"abstract":"<p>Forensics investigators encounter many challenges when it comes to digital evidence: the constantly changing technology that may store evidence, the vast amounts of data involved, and the increasing use of encryption. Cryptography, when used correctly, can prevent any useful information from being retrieved and is encountered in the use of communication protocols, whole-disk encryption, password managers, and so forth. There are some techniques that can assist the investigator when encountering encrypted material. Simple password-based systems can be brute-forced, and live memory capture can obtain key material directly. It has been suggested that the ciphertext length can be used to conclusively determine the plaintext (McGrath, Gladyshev, &amp; Carthy, 2010). In this paper, the authors devise an experiment to test this claim. Based on the results, they argue that there are flaws with this approach.<\/p>","DOI":"10.4018\/jdcf.2013010102","type":"journal-article","created":{"date-parts":[[2013,8,5]],"date-time":"2013-08-05T19:29:42Z","timestamp":1375730982000},"page":"27-38","source":"Crossref","is-referenced-by-count":0,"title":["On the Reliability of Cryptopometry"],"prefix":"10.4018","volume":"5","author":[{"given":"Thomas","family":"Martin","sequence":"first","affiliation":[{"name":"Information Security Program, Khalifa University, Abu Dhabi, UAE"}]},{"given":"Laurence","family":"O\u2019Toole","sequence":"additional","affiliation":[{"name":"Information Security Group, Royal Holloway, University of London, London, UK"}]},{"given":"Andrew","family":"Jones","sequence":"additional","affiliation":[{"name":"Information Security Program, Khalifa University, Abu Dhabi, UAE"}]}],"member":"2432","reference":[{"key":"jdcf.2013010102-0","unstructured":"Bello, L. (2008). DSA-1571-1 openssl \u2013 predictable random number generator. Debian. Retrieved December 06, 2012, from http:\/\/www.debian.org\/security\/2008\/dsa-1571"},{"key":"jdcf.2013010102-1","doi-asserted-by":"crossref","unstructured":"Callas, J., Corporation, P. G. P., & Donnerhacke, L. IKS GmbH, Finney, H., Shaw, D., & Thayer, R (2007). OpenPGP Message Format. IETF Tools. Retrieved December 06, 2012, from http:\/\/tools.ietf.org\/rfc\/rfc4880.txt","DOI":"10.17487\/rfc4880"},{"key":"jdcf.2013010102-2","unstructured":"Corporation, E. C. M. (1999). RSA-155 is factored! RSA Laboratories. Retrieved December 06, 2012, from http:\/\/www.rsa.com\/rsalabs\/node.asp?id=2098"},{"key":"jdcf.2013010102-3","doi-asserted-by":"publisher","DOI":"10.1145\/227234.227239"},{"key":"jdcf.2013010102-4","doi-asserted-by":"crossref","unstructured":"Deutsch, P. Aladdin Enterprises, Gailly J-L., Info-ZIP (1996). ZLIB compressed data format specification version 3.3. IETF Tools. Retrieved December 6, 2012, from http:\/\/www.rsa.com\/rsalabs\/node.asp?id=2098","DOI":"10.17487\/rfc1950"},{"key":"jdcf.2013010102-5","doi-asserted-by":"crossref","unstructured":"Halderman, J. A., Schoen, S. D., Heninger, N., Clarkson, W., Paul, W., & Cal, J. A. \u2026 Felten, E. W. (2008). Lease we remember: Cold boot attacks on encryption keys. USENIX Security Symposium.","DOI":"10.1145\/1506409.1506429"},{"key":"jdcf.2013010102-6","unstructured":"Klein, T. (2006). All your private keys are belong to us \u2013 Extracting RSA private keys and certificates from process memory. trapkit.de. Retrieved December 6, 2012, from http:\/\/www.trapkit.de\/research\/sslkeyfinder\/keyfinder_v1.0_20060205.pdf"},{"key":"jdcf.2013010102-7","doi-asserted-by":"publisher","DOI":"10.4018\/jdcf.2010010101"},{"key":"jdcf.2013010102-8","author":"B.Schneier","year":"1996","journal-title":"Applied cryptography: Protocols, algorithms and source code in C"},{"key":"jdcf.2013010102-9","doi-asserted-by":"crossref","unstructured":"Shamir, A., & Van Someren, N. (1999). Playing \u201chide and seek\u201d with stored keys. In Matthew K. Franklin (Ed.), In Proceedings of the Third International Conference Financial Cryptography (pp. 118-124). Springer.","DOI":"10.1007\/3-540-48390-X_9"}],"container-title":["International Journal of Digital Crime and Forensics"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=79139","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T19:47:35Z","timestamp":1654112855000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jdcf.2013010102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2013,1,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"URL":"https:\/\/doi.org\/10.4018\/jdcf.2013010102","relation":{},"ISSN":["1941-6210","1941-6229"],"issn-type":[{"value":"1941-6210","type":"print"},{"value":"1941-6229","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,1]]}}}