{"id":436,"date":"2024-06-24T19:01:09","date_gmt":"2024-06-24T18:01:09","guid":{"rendered":"https:\/\/fin3ss3g0d.net\/?p=436"},"modified":"2024-06-24T19:01:11","modified_gmt":"2024-06-24T18:01:11","slug":"crack-faster-hack-smarter-custom-hashcat-module-for-apache-shiro-1-sha-512","status":"publish","type":"post","link":"https:\/\/fin3ss3g0d.net\/index.php\/2024\/06\/24\/crack-faster-hack-smarter-custom-hashcat-module-for-apache-shiro-1-sha-512\/","title":{"rendered":"Crack Faster, Hack Smarter: Custom Hashcat Module for Apache Shiro 1\u00a0SHA-512"},"content":{"rendered":"\t\t
\n\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t
\n
 <\/div>\n
\n
\n

Introduction<\/h3>\n

During a recent assessment, we identified a server running Nexus Repository 3 that was vulnerable to CVE-2024\u20134956. This led to us pillaging data from the system and ultimately extracting Apache Shiro 1 SHA-512 password hashes to the web application from this data. Apache Shiro\u2019s version 1 SHA-512 hashing implementation involves salting the input data with a secure, randomly generated value and performing the hash operation iteratively (typically thousands of times) to enhance security against brute-force attacks. In simpler terms, it is a salted, iterated SHA-512 hashing mechanism. In this post, I\u2019ll describe the steps taken to identify the hashing algorithm and how I created a Hashcat module capable of cracking it. This will guide you through the process of creating a custom module to effectively crack these hashes.<\/p>\n

Sonatype Repository 3<\/h3>\n

Before we continue, it\u2019s important to note that the Apache Shiro 1 SHA-512 algorithm is used by Sonatype Repository 3 to hash user credentials for the web application database, as of the time of writing. Since there is a public mirror of the code base available on GitHub, it is possible to view exactly how the application hashes credentials. You can clone the repository from the following URL<\/a>. If we clone that repository and do a recursive grep <\/strong>command for the text \u201cshiro.crypto<\/strong>\u201d, we will get the following results shown below.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

Out of these results, the file responsible for performing password hashing is DefaultSecurityPasswordService.java<\/strong>, which can be accessed here<\/a>. We can look at the relevant parts of the file below.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

The key pieces of information to take away here are the hash algorithm (SHA-512), iterations (1024), the constructor for the class, and the hashPassword<\/strong> method. We can see in the constructor that the passwordService<\/strong> member (of type PasswordService<\/strong>) is set to a new instance of the DefaultPasswordService<\/strong> class. A new DefaultHashService<\/strong> object is created, then configured with the hash algorithm and iterations. The passwordService<\/strong> member then calls the setHashService<\/strong> method using the hashService<\/strong> object. The hashPassword<\/strong> method simply calls the hashPassword<\/strong> method of the passwordService<\/strong> member. The relevant code for the DefaultPasswordService<\/strong> class is shown below and can be accessed via the following URL<\/a>.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

Here we can see the default constructor sets up the class using some defaults, which have been overridden with a custom HashService<\/strong> class object previously shown. We can also see the implementation of hashPassword<\/strong>, which ultimately ends up calling computeHash<\/strong> of the hashService<\/strong> member (of type DefaultHashService<\/strong>). The implementation for computeHash<\/strong> in the DefaultHashService<\/strong> class can be seen below and accessed at the following URL<\/a>.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

We can see there is an attempt to obtain a HashSpi<\/strong> object using the algorithm name, which if successful will call the newHashFactory<\/strong> method on the object, followed by the generate<\/strong> method and return the result. The SHA-512 algorithm will end up creating a new SimpleHashFactory<\/strong> and using its generate<\/strong> method. The generate<\/strong> implementation is shown below and can be accessed at the following URL<\/a>.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

The generate method will ultimately end up calling createSimpleHash<\/strong>, which creates a new SimpleHash<\/strong> class object using the algorithm name, sets the iterations, salt and returns it. The relevant parts of the SimpleHash<\/strong> class are shown below and can be accessed here at the following URL<\/a>.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

We can see the constructor sets the algorithm to be used for future hashing, with the core hashing methods being setBytes<\/strong> and hash<\/strong>, and hash<\/strong> having multiple overloads. The main cryptographic operations involve creating an initial hash using the salt and password bytes, then repeating the hashing process using the previous digest until the iteration count has been reached. Another example of creating an Apache Shiro 1 SHA-512 hash using Java is available in this repository<\/a> and can be seen below.<\/p>\n


<\/p>\n

<\/figure>\n

Previous Research<\/h3>\n

At the time of our assessment, cracking support was very limited with not much information about cracking the algorithm available on the Internet. Searching the title, body, and comments of all Hashcat issues had no mention of the hashing implementation, almost as if it didn\u2019t exist. We were able to come across one post on the Hashcat forum here<\/a> from 2016, which seemed to be the only mention of it by anyone associated with Hashcat. It is also discussing a SHA-256 version of Apache Shiro 1, not to be confused with what our research is focused on, which is a SHA-512 implementation.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

At first, I found this to be confusing because there are plenty of salted and iterated hashes supported by Hashcat in 2024. Thinking about it further, the only explanation I can think of is that in 2016 at the time of the post, Hashcat did not have the capabilities to crack a salted and iterated hash of this nature. The Hashcat kernel structure in 2024 is actually designed around iterated hashes, forcing an author of a kernel to implement a method in the kernel called loop<\/em> where the iterated cryptographic work is done.<\/p>\n

Additionally, although there were a couple gists written in Java<\/a> and C<\/a> floating around, the cracking performance left more to be desired as both of these examples run on the CPU.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

Wanting to increase cracking performance by taking advantage of a multiple GPU hash cracking rig as well as Hashcat features such as advanced rule support, this led to the journey of creating a custom Hashcat module for the Apache Shiro 1 hashing implementation.<\/p>\n

Creating the Hashcat Module<\/h3>\n
<\/figure>\n

Initial Thoughts<\/h3>\n

Looking at the standalone C cracking implementation, it\u2019s apparent that creating a Hashcat module for this hashing implementation should be straightforward, or at least the core cracking logic was already laid out for me. It is an iterated SHA-512 hash with a salt. Could this be that difficult to crack to the point where Hashcat maintainers decided they wouldn\u2019t create a module altogether? Surely, it couldn\u2019t be, could it? I can think of more computationally demanding algorithms for certain. So, why hadn\u2019t it been done before? Has there never been enough of a need\/demand? I never got an answer to these questions throughout this research, but we got the module we wanted so I guess it doesn\u2019t really matter anyways. Looking at some of the Hashcat OpenCL code, there were even libraries for the SHA-512 algorithm. Everything that was needed to create the module was already contained within the repository. My confidence level began to rise for being able to create a working module.<\/p>\n


<\/p>\n

<\/figure>\n

First Steps<\/h3>\n

Before we get started, you can access the module in my Hashcat fork here<\/a> with module 12150 (will require building from source) and follow along with code discussion.<\/p>\n

You will notice if you try to research the topic of creating a Hashcat module, not much exists outside of the Hashcat repository itself. I was able to find this<\/a> blog from 2020 which was helpful but did not cover creating an OpenCL kernel from scratch, which was necessary in our case. The Hashcat repository has extremely thorough documentation for creating your own module (also called a plugin by Hashcat developers) available here<\/a>, and it is official documentation\/advice from the developers themselves. It is a full-blown guide walking you through the entire process of creating your own module and gives you some necessary prerequisite knowledge. Using this guide, if you have the necessary C programming knowledge to implement the algorithm you will be able to create your own module fairly easily. More advice would be to remain patient when you are going on this journey, do not expect instant results on the first day. There is a learning curve associated with this task and you have to learn the lay of the land first before you can have success creating a module. If you study the plugin development guide, it will give you all of the necessary information you need to create your own module.<\/p>\n

Ultimately, we will be creating two files which will be the module C code file and the OpenCL kernel code file. The module C code registers the module with Hashcat itself and handles everything except for the raw cryptographic operations of the algorithm you are trying to implement. The raw cryptographic operations are implemented in the OpenCL kernel file. This is a brief explanation while the plugin development guide goes into much further detail. We will start by covering the module C code.<\/p>\n

Creating the Module C Code<\/h3>\n
<\/figure>\n

Background and Beginning of Module<\/h4>\n

The beginning of the module is setting up some necessary configurations that will modify the behavior of the module and will instruct Hashcat how to operate. The beginning of the Apache Shiro 1 module is shown below.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

Every Hashcat module will follow the same structure in the beginning of its code, and each of the methods shown above are mandatory for every module to implement as they provide Hashcat the necessary information it needs to run the module. A module can also implement other methods that aren\u2019t required or shown above. You can find the documentation for each of these methods below:<\/p>\n

\u00b7 module_attack_exec<\/a><\/p>\n

\u00b7 module_dgst_pos0\u200a\u2014\u200amodule_dgst_pos3<\/a><\/p>\n

\u00b7 module_dgst_size<\/a><\/p>\n

\u00b7 module_hash_category<\/a><\/p>\n

\u00b7 module_hash_name<\/a><\/p>\n

\u00b7 module_kern_type<\/a><\/p>\n

\u00b7 module_opti_type<\/a><\/p>\n

\u00b7 module_opts_type<\/a><\/p>\n

\u00b7 module_salt_type<\/a><\/p>\n

\u00b7 module_st_hash<\/a><\/p>\n

\u00b7 module_st_pass<\/a><\/p>\n


<\/p>

Below are some snippets of the documentation for module_opti_type<\/strong> and module_opts_type<\/strong>.<\/p>\n


<\/p>\n

<\/figure>\n

<\/figure>\n
<\/figure>\n

Remaining Methods<\/h4>\n

In order to complete this module, there were only five more methods to implement:<\/p>\n

\u00b7 module_tmp_size<\/strong>: Returns the size of the tmps<\/strong> structure<\/p>\n

\u00b7 module_pw_max<\/strong>: Returns a size that is the maximum length for any given password this algorithm produces<\/p>\n

\u00b7 module_hash_decode<\/strong><\/a><\/p>\n

\u00b7 module_hash_encode<\/strong><\/a><\/p>\n

\u00b7 module_init<\/strong>: Register all the functions that you have programmed by assigning it to module_ctx, initializing the module<\/p>\n

The tmps Structure<\/h4>\n

An important structure to explain at this point would be the tmps<\/strong> structure, which has a definition of: \u201cvoid *<\/em>tmps<\/em><\/strong>: This is the generic context buffer. It is available only in slow hash kernel mode. In slow hash mode you want to read and write this buffer. There is one entry for each work item.\u201c<\/em> Not to get ahead of ourselves before we talk about the kernel in more depth, but below is more context on the tmps<\/strong> structure on the kernel side of things.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

We\u2019ll talk more about this structure later as it is a significant part of the module. At this point, we would then begin developing the five methods listed above assuming our mandatory methods are in place. Below is an example of our tmps<\/strong> structure along with the implementation for module_tmp_size <\/strong>and module_pw_max<\/strong>.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

We define our tmps<\/strong> structure in the module C code and return its size in the module_tmp_size <\/strong>method so the kernel knows its size and how large of a buffer to allocate for the structure. The structure can be broken down as follows:<\/p>\n

\u00b7 dgst<\/strong>: Temporary hash digest buffer<\/p>\n

\u00b7 out<\/strong>: Final output hash to use during comparisons<\/p>\n

The module_hash_decode Method<\/h4>\n

This brings us to the module_hash_decode <\/strong>method which can be described as: \u201cThe decoder function is the function that is called again and again for every line in your hashfile. We also call this sometimes the hash parser. Here you have to program the logic which decodes the line into its components and then stores them in the standardized data structure which hashcat understands.\u201c<\/em> The method can be described as accomplishing the following goals shown below.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

The above might sound like a lot, but in our case it\u2019s really not. The tokenizer<\/strong> is a means of extracting the necessary data from each hash string we decode during this method such as the salt and hash bytes. Here\u2019s an example of our module_hash_decode <\/strong>method below.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

With the salt, hash, and iteration data extracted during the tokenizer<\/strong> phase, we can then prepare the salt and digest buffers as shown below which finishes the method.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

At this point, the salt buffer is prepared with the salt bytes and iterations. The digest buffer containing the hash bytes is also prepared which is used in hash comparisons. For example, the kernel will generate a hash based on an entry in a wordlist and compare that hash to this one. If they match, you know you cracked the hash. Be aware that you will need to manually manage endianness throughout this process, hence the byte swap shown above. In this case, we needed to convert the raw buffer bytes to 64-bit integer format for storing the digest. This is how the final digest is stored by the Hashcat crypto library in our case for SHA-512.<\/p>\n

The module_hash_encode Method<\/h4>\n

The next method implemented in the module is module_hash_encode <\/strong>which can be explained as seen below.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

The implementation is shown below, in this case we could simply use the original hash buffer that was read from the input hash file.<\/p>\n


<\/p>\n

<\/figure>\n

Wrapping Things Up<\/h4>\n

The last method to implement was module_init <\/strong>which can be explained as shown below.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

I won\u2019t show the implementation for our module, but it is straightforward, and you can find plenty of examples throughout the Hashcat source code as every module has it implemented. At this point, we are ready to jump into the kernel code!<\/p>\n

Creating the Kernel<\/h3>\n
<\/figure>\n


<\/p>\n

As previously mentioned, the second file we are required to create is the OpenCL file which is our kernel. Shown below is some introductory information about the kernel from the Hashcat documentation.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

Before we continue any further, let\u2019s take a step back for a second and talk about what OpenCL is and what an OpenCL kernel is. We will refer to the overall OpenCL file as a kernel as well as individual methods inside of the file. Hashcat uses OpenCL (Open Computing Language) for its kernels, which are the core components responsible for performing the actual hash computations. The .cl<\/strong> file extension indicates OpenCL source files.<\/p>\n

What is OpenCL?<\/h4>\n

OpenCL is a framework for writing programs that execute across heterogeneous platforms, including CPUs, GPUs, and other processors. It allows developers to write code that can run on different types of hardware, making it versatile for high-performance computing tasks.<\/p>\n

Kernel Programming in OpenCL<\/h4>\n

C-like Syntax<\/strong>: The syntax of OpenCL kernels is very similar to the C programming language. This is because OpenCL is based on a subset of ISO C99, with some extensions and restrictions to accommodate the parallel nature of the hardware it targets.<\/p>\n

Parallel Computing<\/strong>: OpenCL is designed to exploit the parallelism of GPUs and other hardware accelerators. This makes it highly suitable for tasks like hash computation, which can benefit from being parallelized.<\/p>\n

Components of an OpenCL Program<\/h4>\n

Host Code<\/strong>: Written in a standard programming language like C or C++, the host code sets up the OpenCL environment, compiles the OpenCL kernel code, and manages data transfer between the host and the device.<\/p>\n

Kernel Code<\/strong>: Written in OpenCL C, this code runs on the OpenCL-compatible device (such as a GPU). The kernel code is what you see in the .cl<\/strong> files.<\/p>\n

OpenCL Background Summary<\/h4>\n

Before starting this journey, I was a complete noob to OpenCL, so I thought leaving this information here would be beneficial for anybody attempting to go down this path. Since we are trying to create a kernel for the module, it is helpful to know how it works from a technological perspective. Now that we know what we are dealing with, let\u2019s dive into the implementation.<\/p>\n

Hashcat Kernel Background<\/h4>\n

Shown below is documentation from Hashcat explaining what a slow hash type kernel is, along with information about the three methods you need to implement inside the kernel. This documentation can be accessed here<\/a>. The Apache Shiro 1 kernel is a slow hash type kernel due to the algorithm being so demanding that the PCI Express Bottleneck is no longer relevant as it is with fast hash types. This is largely due to the fact the hash is iterated.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

Below is further documentation about the three kernels and the sequence in which you will typically interact with the tmps<\/strong> context buffer.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

Another important thing to know when developing your kernel is what macro you should use for each of the methods. A list of the macros can be seen below and accessed here<\/a>. The Apache Shiro 1 module will use the KERN_ATTR_TMPS(t) <\/strong>macro for all of the kernels since they only use a tmps<\/strong> structure.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

The last important thing you will need to know when developing a kernel are the kernel parameters (documentation link shared above). As discussed previously, OpenCL programs allow data transfer between a host and a device. All of the parameters you see below are accessible to every kernel. A good example of this is how we extracted the salt in the module C code during the module_hash_decode <\/strong>method. This ends up going in a buffer called salt_bufs<\/strong>. The buffer is then passed to the kernel so the kernel code can interact with the salt. Once we start going through the kernel code for the Apache Shiro 1 module and you see some working examples, these will start to make more sense. A snippet of the kernel parameters Hashcat documentation is shown below.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

At this point, now that we understand the structure of a kernel, the three methods that we need to implement and what their purposes are along with some necessary prerequisite knowledge, we are ready to begin developing the kernel.<\/p>\n

The init Method<\/h4>\n

In order to understand what we need to do in this method, we can refer to the standalone C cracking implementation for inspiration here<\/a>.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

The piece of code highlighted above is what we will ultimately need to replicate in our init<\/strong> method of our kernel. This will create an initial SHA-512 hash digest using the salt and password. How we can replicate this in our init<\/strong> method of our kernel is shown below.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

Let\u2019s break this down a little bit. Firstly, we are using a pre-existing Hashcat helper file for SHA-512 (inc_hash_sha512.cl<\/strong>) which already contains the necessary methods we need for the kernel of this algorithm. This is where all of the sha512<\/strong> prefixed methods are coming from as well as the sha512_ctx_t <\/strong>structure. Overall, the method should look really similar to the OpenSSL standalone C cracking application. A question you might have is what is going on with the swap methods? In this particular case, we are converting data between 32-bit and 64-bit integer format as required by the algorithm, which really comes down to how the structures and methods for the cryptographic operations want the data. After updating the sha512_ctx_t <\/strong>structure with the salt and password, we call sha512_final <\/strong>and update the tmps dgst <\/strong>and out<\/strong> buffers with the resulting hash digest. We are now ready to implement the loop<\/strong> method.<\/p>\n

The loop Method<\/h4>\n

As shown earlier, this method is where the iterative cryptographic work will take place since this is an iterated hash algorithm. In this case, we will continue creating a new hash based on the previous hash value until the iteration count is reached. The code highlighted from the standalone C cracking application can be used as inspiration for what we will need to implement.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

The relevant portions of the implementation for the kernel loop method are shown below.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

In the beginning of the method, we convert our hash digest contained in the tmps dgst <\/strong>buffer from u64<\/strong> to u32<\/strong>. This is because the sha512_update <\/strong>method is expecting our data to be in u32<\/strong> format and if we try to use the u64<\/strong> data by performing a simple cast, we will produce inaccurate hashes due to the cryptographic operations being performed on data which is not in the expected endianness. We then perform the hashing loop, similarly to the standalone C cracking example. In this case, LOOP_CNT<\/strong> instructs the method how many times to perform the iterative cryptographic operations. Once LOOP_CNT<\/strong> equals the total number of times the hash was supposed to be iterated, the comp<\/strong> method will be called. At the end of the method, we update the out <\/strong>buffer of tmps<\/strong> with the last generated digest which will be used for the comparison in the comp<\/strong> method.<\/p>\n

The comp Method<\/h4>\n

This method performs the hash comparison logic, which will essentially check to see if the produced hash from the kernel matches the target hash digest we are trying to crack. The standalone C cracking example simply used memcmp<\/strong> to check and see if the target digest buffer equaled the generated hash buffer. Hashcat has a much more sophisticated way of performing hash comparison which utilizes a bloom filter and an additional binary tree search. An explanation of this can be seen below.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

As mentioned above, we will follow suit on how to use the COMPARE_M<\/strong> macro. We will assign the final digest to r0<\/strong>\u200a\u2014\u200ar3<\/strong> which needs to be in u32<\/strong> format, then call the #include<\/strong> COMPARE_M<\/strong> macro. The Apache Shiro 1 comp<\/strong> kernel is shown below.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

As you can see, we convert the final digest contained in out <\/strong>of tmps<\/strong> to u32<\/strong> (or as much of it as can fit in the four comparison variables) and then call the COMPARE_M<\/strong> macro which will do the bloom filter comparison along with an additional binary tree search for light speed<\/em> comparisons. At this point, we are done creating the kernel and the module and it is ready for use!<\/p>\n

Testing the Module<\/h3>\n

Test Suite Background<\/h4>\n

Once we have our module kernel and C code put together and we believe we are ready to test it, Hashcat comes with its own testing mechanism called the Test Suite. A snippet of the documentation<\/a> for the Test Suite can be seen below. The Test Suite is explained in detail at the provided link, but the idea is to provide a way to ensure that a module is working correctly (both the C code and OpenCL kernel).<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

This is done by using a higher-level programming language, in this case Perl, to perform the cryptographic operations. The Test Suite can either test cracking data generated by the test module with the low-level module or verify that the reported cracked data from the low-level module is accurate. While everyone has a different level of knowledge when it comes to cryptography and programming, cryptographic implementations between two programming languages are the same. This means that although the code will look different due to the different syntax of the programming languages, the actual cryptographic operations on the data will remain the same.<\/p>\n

Why is this a good testing strategy? If we can verify that we can crack data generated by the Perl test module, it is highly likely that our cryptographic operations in our kernel are accurate and true to the algorithm. Additionally, we can conclude that our methods in the module C code are working as expected, providing a way to test the entire module.<\/p>\n

Before we continue, let\u2019s discuss the test scripts which automate the testing process. Throughout this process, you are going to be working closely with two scripts which are test.pl<\/strong><\/a> and test.sh<\/strong><\/a>. The test.sh <\/strong>script comes with different command line arguments that allow you to change the behavior of testing and automates most of the testing process by executing Hashcat commands generated by test.pl<\/strong>. You can think of it as a wrapper around test.pl<\/strong>. Everything except verify <\/strong>tests will be automated by test.sh<\/strong>.<\/p>\n

Perl Test Module Development<\/h4>\n

As you can see in the screenshot above, there are three methods our test module must implement and they are module_constraints<\/strong>, module_generate_hash<\/strong>, and module_verify_hash<\/strong>. There is more documentation<\/a> for test modules and an explanation of these methods is provided below.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

As you can see, this documentation provides links to various Perl modules that you can look at as examples. I encourage you to try to find a module that is closest to the module you are trying to create as that will contain the most relevant example code. The module_constraints<\/strong> to module_generate_hash<\/strong> implementations for our module can be seen below.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

As shown above, module_constraints<\/strong> returns the minimum and maximum length for a password hashed using this algorithm as well as the size for generated salts, which is 16 bytes. Also shown is module_generate_hash<\/strong>, which takes three arguments being: a password to hash, the salt to use for the hash, and the number of iterations to perform on the hash. It then generates a hash using these arguments and returns it, which will be used as part of testing with test.sh<\/strong>\/test.pl<\/strong>. This method should generate a hash for your algorithm, preferably using Perl cryptography libraries and the arguments passed to the method. The arguments that are passed are controlled by the test.pl<\/strong>\/test.sh <\/strong>programs and based on which test is being performed. It is important to make sure your Perl implementation is accurate according to the specification for the algorithm, otherwise all your testing will be inaccurate. You should test it independently from Hashcat and verify generated hashes are accurate and make sure your logic for module_verify_hash<\/strong> is working correctly before performing a test with the Test Suite.<\/p>\n

Running test.sh<\/h4>\n

At this point, we are ready to run test.sh<\/strong> to test cracking using the module and will focus on module_verify_hash<\/strong> later. If you are a Windows user developing\/testing your module on a Windows host, you might have been like me at the beginning of this process and had a reaction similar to the one below regarding the test.sh <\/strong>script.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

No need to fear though as we can still test our module on Windows using WSL\/WSL2 or Cygwin using the test.sh<\/strong> script and providing \u201cwin<\/strong>\u201d for the -o <\/strong>flag. Our command line for running test.sh<\/strong> is displayed below.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

Here is an explanation of these flags and their values:<\/p>\n

\u00b7 -m 12150<\/strong>: specifically test using the m12150.pm<\/strong> test module<\/p>\n

\u00b7 -a all<\/strong>: test all attack modes<\/p>\n

\u00b7 -t all<\/strong>: test single<\/strong> and multi<\/strong> hash modes<\/p>\n

\u00b7 -P<\/strong>: use pure kernels instead of optimized kernels since our module\u2019s kernel is pure without an optimized version<\/p>\n

\u00b7 -o win<\/strong>: use the Windows operating system (adds .exe file extension to Hashcat binary to run with WSL\/WSL2\/Cygwin)<\/p>\n


<\/p>

The output shown in our screenshot from the test.sh<\/strong> script indicates success for all tests. Since everything was found\/matched and nothing timed out or was skipped, all tests passed. A success from this test command means the module was able to successfully crack hashes generated by the Perl test module. If you were getting results showing hashes were not found\/matched, timeouts, or hashes being skipped, these would be indicators of failed tests. Now onto the module_verify_hash<\/strong> method.<\/p>\n

Running Verify Test<\/h4>\n

Since we require a sample of cracked hashes to perform verify<\/strong> tests, they are not automated by test.sh<\/strong> and are run post-crack. The flow for performing a verify<\/strong> test would be to: generate known hashes, crack them to a pot file<\/strong>, and then run test.pl <\/strong>in verify mode while supplying the hash file, hash mode, pot file<\/strong>, and output file as arguments. The purpose of this test is to verify if cracked hashes are being accurately marked. Our implementation for module_verify_hash <\/strong>is shown below.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

As you can see, it will take a line from the pot file<\/strong> and extract the password, salt, and number of iterations from it. From there, it will generate a new hash using module_generate_hash<\/strong>. Next, test.pl<\/strong> will perform a comparison of the newly generated hash against all hashes in the original hash file. If there is not a match, it is an indicator that the module is reporting false positives for cracked hashes and there is likely an issue with the comp <\/strong>method of your kernel. Below is an example of generating hashes to be cracked and used for a verify <\/strong>test using shiro-hash-generator<\/a>.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

We can then perform the crack using the command below.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

Following this command, the crack results will be stored in test.potfile <\/strong>in <DIGEST<\/strong>>:<PASSWORD<\/strong>> format. We can then perform our verify <\/strong>test with test.pl<\/strong> which is shown below.<\/p>\n


<\/p>\n

<\/figure>\n


<\/p>\n

Looking at the documentation for verify <\/strong>above, we can see that if a hash in the pot file<\/strong> matches an entry in the hashes file, it will be written to the out file indicating a successful verification. After running test.pl<\/strong>, the contents of log.txt<\/strong> are displayed, which contains all of our pot file <\/strong>entries. This result indicates a successful test and that our module is accurately marking hashes as cracked. This concludes testing our module using the Hashcat Test Suite!<\/p>\n

Conclusion<\/h3>\n
<\/figure>\n

From Weeks to Hours: Hashcat Module Performance<\/h3>\n

When we discuss performance of the Hashcat module versus the standalone C implementation, the weakpass_3a<\/a> wordlist was going to take multiple weeks for one hash to complete after modifying the C program<\/a> to take an input hash as a commandline argument. The hash cracking rig we are using (which has 10 NVIDIA RTX 3090\u2019s) was able to perform a crack using the same wordlist against 16 hashes in 1 hour and 45 minutes with a speed of testing hashes at 21613.7 kH\/s (21,613,700 per second) using the Hashcat module.<\/p>\n


<\/p>\n

<\/figure>\n

Takeaways<\/h3>\n
<\/figure>\n


<\/p>\n

Overall, there are some key pieces of information to take away here:<\/p>\n

    \n
  • The Apache Shiro 1 SHA-512 hashing algorithm used to have a limited attack surface due to the lack of Hashcat support or similar project that can utilize GPU hardware to crack the algorithm; this is no longer true.<\/li>\n
  • Sonatype\u2019s default iteration count is relatively low at 1024 iterations per hash and is actually below the Apache Shiro default iteration, making it a fairly inexpensive algorithm with decent cracking times.<\/li>\n
  • Sonatype hashes user credentials for the web application database using this algorithm, if a system is vulnerable to a LFI\/path traversal (i.e. CVE-2024\u20134956) vulnerability, you can extract these hashes from OrientDB .pcl<\/strong> files and then crack them with the Hashcat module. Any other means of gaining access to these files is valid such as compromising a system where these files have been backed up, compromising a system through a different vulnerability, etc.<\/li>\n
  • We learned how to create a moderately complex Hashcat module as well as where to find the official documentation for plugin development that can be applied to different algorithms if we come across a situation such as this in the future. We also learned how to test our module to make sure it is working correctly.<\/li>\n<\/ul>\n

    <\/figure>\n
    <\/figure>\n


    <\/p>\n

    The advice I will give at the end of this piece of writing is to keep calm and hack the planet!<\/p>\n<\/div>\n<\/div>\n<\/section>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"

      Introduction During a recent assessment, we identified a server running Nexus Repository 3 that was vulnerable to CVE-2024\u20134956. This […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"default","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","ast-disable-related-posts":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"var(--ast-global-color-4)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""}},"footnotes":""},"categories":[1],"tags":[],"class_list":["post-436","post","type-post","status-publish","format-standard","hentry","category-blog"],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/fin3ss3g0d.net\/index.php\/wp-json\/wp\/v2\/posts\/436","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/fin3ss3g0d.net\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/fin3ss3g0d.net\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/fin3ss3g0d.net\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/fin3ss3g0d.net\/index.php\/wp-json\/wp\/v2\/comments?post=436"}],"version-history":[{"count":3,"href":"https:\/\/fin3ss3g0d.net\/index.php\/wp-json\/wp\/v2\/posts\/436\/revisions"}],"predecessor-version":[{"id":439,"href":"https:\/\/fin3ss3g0d.net\/index.php\/wp-json\/wp\/v2\/posts\/436\/revisions\/439"}],"wp:attachment":[{"href":"https:\/\/fin3ss3g0d.net\/index.php\/wp-json\/wp\/v2\/media?parent=436"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fin3ss3g0d.net\/index.php\/wp-json\/wp\/v2\/categories?post=436"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fin3ss3g0d.net\/index.php\/wp-json\/wp\/v2\/tags?post=436"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}