├── .gitignore ├── Android └── examples │ ├── RootBeer │ ├── java-bypass.r2 │ ├── native-analysis.r2 │ ├── native-bypass-open.r2 │ └── native-bypass.r2 │ └── Uncrackable1 │ ├── aesinfo.js │ ├── bypass-root.r2 │ └── decrypt-flag.js ├── LICENSE ├── common ├── basic-analysis.r2 ├── plugin_template.js └── r2cmd.js └── iOS ├── examples ├── analyze_macho.js ├── cfstring.js ├── heap.js ├── hello.js └── resolver.js ├── jbdetection └── disable_jbdetection.js ├── sslpinning ├── afn_pinning.js ├── afn_trace.r2 ├── boringssl_pinning.js ├── bypass_afn.r2 ├── http_trace.r2 ├── log_ssl_keys.js ├── log_ssl_keys.r2 ├── nsurl_pinning.js └── nsurl_trace.r2 └── url_schema └── urlschema_fuzz.js /.gitignore: -------------------------------------------------------------------------------- 1 | .DS_Store 2 | 3 | -------------------------------------------------------------------------------- /Android/examples/RootBeer/java-bypass.r2: -------------------------------------------------------------------------------- 1 | :di0 java:com.scottyab.rootbeer.RootBeer.checkSuExists 2 | :di0 java:com.scottyab.rootbeer.RootBeer.checkForSuBinary 3 | :di0 java:com.scottyab.rootbeer.RootBeer.checkForRWPaths 4 | :di0 java:com.scottyab.rootbeer.RootBeer.checkForMagiskBinary 5 | -------------------------------------------------------------------------------- /Android/examples/RootBeer/native-analysis.r2: -------------------------------------------------------------------------------- 1 | e emu.str = true 2 | .:il* 3 | :il~check 4 | s lib.libtool_checker.so 5 | .:ii* 6 | .:iE* 7 | -------------------------------------------------------------------------------- /Android/examples/RootBeer/native-bypass-open.r2: -------------------------------------------------------------------------------- 1 | :dtf open z 2 | -------------------------------------------------------------------------------- /Android/examples/RootBeer/native-bypass.r2: -------------------------------------------------------------------------------- 1 | .:il* 2 | s lib.libtool_checker.so 3 | .:ii* 4 | .:iE* 5 | :e hook.output=json 6 | :e hook.backtrace=false 7 | :dtf `:iE~exist:0[0]` z 8 | :di0 `:iE~exist:0[0]` 9 | -------------------------------------------------------------------------------- /Android/examples/Uncrackable1/aesinfo.js: -------------------------------------------------------------------------------- 1 | Java.perform(function() { 2 | 3 | var use_single_byte = false; 4 | var complete_bytes = new Array(); 5 | var index = 0; 6 | 7 | 8 | var secretKeySpecDef = Java.use('javax.crypto.spec.SecretKeySpec'); 9 | 10 | var ivParameterSpecDef = Java.use('javax.crypto.spec.IvParameterSpec'); 11 | 12 | var cipherDef = Java.use('javax.crypto.Cipher'); 13 | 14 | var cipherDoFinal_1 = cipherDef.doFinal.overload(); 15 | var cipherDoFinal_2 = cipherDef.doFinal.overload('[B'); 16 | var cipherDoFinal_3 = cipherDef.doFinal.overload('[B', 'int'); 17 | var cipherDoFinal_4 = cipherDef.doFinal.overload('[B', 'int', 'int'); 18 | var cipherDoFinal_5 = cipherDef.doFinal.overload('[B', 'int', 'int', '[B'); 19 | var cipherDoFinal_6 = cipherDef.doFinal.overload('[B', 'int', 'int', '[B', 'int'); 20 | 21 | var cipherUpdate_1 = cipherDef.update.overload('[B'); 22 | var cipherUpdate_2 = cipherDef.update.overload('[B', 'int', 'int'); 23 | var cipherUpdate_3 = cipherDef.update.overload('[B', 'int', 'int', '[B'); 24 | var cipherUpdate_4 = cipherDef.update.overload('[B', 'int', 'int', '[B', 'int'); 25 | 26 | var secretKeySpecDef_init_1 = secretKeySpecDef.$init.overload('[B', 'java.lang.String'); 27 | 28 | var secretKeySpecDef_init_2 = secretKeySpecDef.$init.overload('[B', 'int', 'int', 'java.lang.String'); 29 | 30 | var ivParameterSpecDef_init_1 = ivParameterSpecDef.$init.overload('[B'); 31 | 32 | var ivParameterSpecDef_init_2 = ivParameterSpecDef.$init.overload('[B', 'int', 'int'); 33 | 34 | secretKeySpecDef_init_1.implementation = function(arr, alg) { 35 | var key = b2s(arr); 36 | send("Creating " + alg + " secret key, plaintext:\\n" + hexdump(key)); 37 | return secretKeySpecDef_init_1.call(this, arr, alg); 38 | } 39 | 40 | secretKeySpecDef_init_2.implementation = function(arr, off, len, alg) { 41 | var key = b2s(arr); 42 | send("Creating " + alg + " secret key, plaintext:\\n" + hexdump(key)); 43 | return secretKeySpecDef_init_2.call(this, arr, off, len, alg); 44 | } 45 | 46 | /*ivParameterSpecDef_init_1.implementation = function(arr) 47 | { 48 | var iv = b2s(arr); 49 | send("Creating IV:\\n" + hexdump(iv)); 50 | return ivParameterSpecDef_init_1.call(this, arr); 51 | } 52 | 53 | ivParameterSpecDef_init_2.implementation = function(arr, off, len) 54 | { 55 | var iv = b2s(arr); 56 | send("Creating IV, plaintext:\\n" + hexdump(iv)); 57 | return ivParameterSpecDef_init_2.call(this, arr, off, len); 58 | }*/ 59 | 60 | cipherDoFinal_1.implementation = function() { 61 | var ret = cipherDoFinal_1.call(this); 62 | info(this.getIV(), this.getAlgorithm(), complete_bytes, ret); 63 | return ret; 64 | } 65 | 66 | cipherDoFinal_2.implementation = function(arr) { 67 | addtoarray(arr); 68 | var ret = cipherDoFinal_2.call(this, arr); 69 | info(this.getIV(), this.getAlgorithm(), complete_bytes, ret); 70 | return ret; 71 | } 72 | 73 | cipherDoFinal_3.implementation = function(arr, a) { 74 | addtoarray(arr); 75 | var ret = cipherDoFinal_3.call(this, arr, a); 76 | info(this.getIV(), this.getAlgorithm(), complete_bytes, ret); 77 | return ret; 78 | } 79 | 80 | cipherDoFinal_4.implementation = function(arr, a, b) { 81 | addtoarray(arr); 82 | var ret = cipherDoFinal_4.call(this, arr, a, b); 83 | info(this.getIV(), this.getAlgorithm(), complete_bytes, ret); 84 | return ret; 85 | } 86 | 87 | cipherDoFinal_5.implementation = function(arr, a, b, c) { 88 | addtoarray(arr); 89 | var ret = cipherDoFinal_5.call(this, arr, a, b, c); 90 | info(this.getIV(), this.getAlgorithm(), complete_bytes, ret); 91 | return ret; 92 | } 93 | 94 | cipherDoFinal_6.implementation = function(arr, a, b, c, d) { 95 | addtoarray(arr); 96 | var ret = cipherDoFinal_6.call(this, arr, a, b, c, d); 97 | info(this.getIV(), this.getAlgorithm(), complete_bytes, c); 98 | return ret; 99 | } 100 | 101 | cipherUpdate_1.implementation = function(arr) { 102 | addtoarray(arr); 103 | return cipherUpdate_1.call(this, arr); 104 | } 105 | 106 | cipherUpdate_2.implementation = function(arr, a, b) { 107 | addtoarray(arr); 108 | return cipherUpdate_2.call(this, arr, a, b); 109 | } 110 | 111 | cipherUpdate_3.implementation = function(arr, a, b, c) { 112 | addtoarray(arr); 113 | return cipherUpdate_3.call(this, arr, a, b, c); 114 | } 115 | 116 | cipherUpdate_4.implementation = function(arr, a, b, c, d) { 117 | addtoarray(arr); 118 | return cipherUpdate_4.call(this, arr, a, b, c, d); 119 | } 120 | 121 | function info(iv, alg, plain, encoded) { 122 | send("Performing encryption/decryption"); 123 | if (iv) { 124 | send("Initialization Vector: \\n" + hexdump(b2s(iv))); 125 | } else { 126 | send("Initialization Vector: " + iv); 127 | } 128 | send("Algorithm: " + alg); 129 | send("In: \\n" + hexdump(b2s(plain))); 130 | send("Out: \\n" + hexdump(b2s(encoded))); 131 | complete_bytes = []; 132 | index = 0; 133 | } 134 | 135 | function hexdump(buffer, blockSize) { 136 | blockSize = blockSize || 16; 137 | var lines = []; 138 | var hex = "0123456789ABCDEF"; 139 | for (var b = 0; b < buffer.length; b += blockSize) { 140 | var block = buffer.slice(b, Math.min(b + blockSize, buffer.length)); 141 | var addr = ("0000" + b.toString(16)).slice(-4); 142 | var codes = block.split('').map(function(ch) { 143 | var code = ch.charCodeAt(0); 144 | return " " + hex[(0xF0 & code) >> 4] + hex[0x0F & code]; 145 | }).join(""); 146 | codes += " ".repeat(blockSize - block.length); 147 | var chars = block.replace(/[\\x00-\\x1F\\x20]/g, '.'); 148 | chars += " ".repeat(blockSize - block.length); 149 | lines.push(addr + " " + codes + " " + chars); 150 | } 151 | return lines.join("\\n"); 152 | } 153 | 154 | function b2s(array) { 155 | var result = ""; 156 | for (var i = 0; i < array.length; i++) { 157 | result += String.fromCharCode(modulus(array[i], 256)); 158 | } 159 | return result; 160 | } 161 | 162 | function modulus(x, n) { 163 | return ((x % n) + n) % n; 164 | } 165 | 166 | function addtoarray(arr) { 167 | for (var i = 0; i < arr.length; i++) { 168 | complete_bytes[index] = arr[i]; 169 | index = index + 1; 170 | } 171 | } 172 | }); 173 | -------------------------------------------------------------------------------- /Android/examples/Uncrackable1/bypass-root.r2: -------------------------------------------------------------------------------- 1 | :dis java:java.lang.System.exit 2 | -------------------------------------------------------------------------------- /Android/examples/Uncrackable1/decrypt-flag.js: -------------------------------------------------------------------------------- 1 | function bufferToString(buf) { 2 | var buffer = Java.array('byte', buf); 3 | var result = ""; 4 | for(var i = 0; i < buffer.length; ++i){ 5 | result += (String.fromCharCode(buffer[i] & 0xff)); 6 | } 7 | return result; 8 | } 9 | 10 | console.log("Having fun with Frida :D "); 11 | Java.perform(function x() { 12 | console.log("Start hooking..."); 13 | var aes_decrypt = Java.use("sg.vantagepoint.a.a"); 14 | aes_decrypt.a.overload("[B","[B").implementation = function(var_0,var_1) { 15 | console.log("sg.vantagepoint.a.a.a([B[B)[B doFinal(enc) // AES/ECB/PKCS7Padding"); 16 | var retval = this.a(var_0, var_1); 17 | const flag = bufferToString(retval); 18 | console.log("Decrypted flag: " + flag); 19 | return retval; 20 | }; 21 | }); 22 | 23 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /common/basic-analysis.r2: -------------------------------------------------------------------------------- 1 | .:init 2 | .:ii* 3 | .:iE* 4 | -------------------------------------------------------------------------------- /common/plugin_template.js: -------------------------------------------------------------------------------- 1 | 'use strict'; 2 | 3 | const commands = { 4 | 'example': example_func 5 | }; 6 | 7 | r2frida.pluginRegister('example', function (name) { 8 | return commands[name]; 9 | }); 10 | 11 | async function example_func(args) { 12 | return args[0]; 13 | } 14 | -------------------------------------------------------------------------------- /common/r2cmd.js: -------------------------------------------------------------------------------- 1 | 'use strict'; 2 | 3 | 4 | const commands = { 5 | 'r2cmd': r2cmd 6 | }; 7 | 8 | r2frida.pluginRegister('r2cmd', function (name) { 9 | return commands[name]; 10 | }); 11 | 12 | function r2cmd(args) { 13 | return new Promise((resolve, reject) => { 14 | try { 15 | r2frida 16 | .hostCmd('?E hello from r2') 17 | .then(res => { 18 | resolve(res); 19 | }); 20 | } catch(e) { 21 | console.error(e); 22 | reject(e); 23 | } 24 | }); 25 | } 26 | -------------------------------------------------------------------------------- /iOS/examples/analyze_macho.js: -------------------------------------------------------------------------------- 1 | 'use strict'; 2 | 3 | const getFunction = (symbol, ret, args) => 4 | new NativeFunction(Module.findExportByName(null, symbol), ret, args) 5 | 6 | const open = getFunction('open', 'int', ['pointer', 'int', 'int']) 7 | const close = getFunction('close', 'int', ['int']) 8 | const read = getFunction('read', 'int', ['int', 'pointer', 'int']) 9 | const write = getFunction('write', 'int', ['int', 'pointer', 'int']) 10 | const lseek = getFunction('lseek', 'int64', ['int', 'int64', 'int']) 11 | const unlink = getFunction('unlink', 'int', ['pointer']) 12 | 13 | const O_RDONLY = 0 14 | const O_RDWR = 2 15 | const SEEK_SET = 0 16 | const PROT_READ = 0x1 17 | const PROT_WRITE = 0x2 18 | const MAP_SHARED = 0x1 19 | const MAP_PRIVATE = 0x2 20 | 21 | const commands = { 22 | 'decrypt': decrypt, 23 | 'analyze*': analyzeR2, 24 | 'analyzej': analyze 25 | }; 26 | 27 | r2frida.pluginRegister('r2flutch', function (name) { 28 | return commands[name]; 29 | }); 30 | 31 | async function analyzeR2(args) { 32 | const flags = await analyze(args); 33 | return flags.map(flag => { 34 | return `f ${flag.name} = ${flag.addr};`; 35 | }).join('\n'); 36 | } 37 | 38 | function analyze(args) { 39 | return new Promise((resolve, reject) => { 40 | let flags = []; 41 | 42 | const baseAddr = checkIsValidMacho(); 43 | if (!baseAddr) { 44 | reject('Error'); 45 | } 46 | const header = parseMachoHeader(baseAddr, flags); 47 | if (!header) { 48 | reject('Error'); 49 | } 50 | const segments = getSegments(baseAddr, header.ncmds, flags); 51 | segments.forEach((segment) => { 52 | if(segment.name == '__TEXT') { 53 | getSections(segment, flags); 54 | } 55 | }); 56 | const encryption_info = getEncryptionInfo(baseAddr, header.ncmds, flags); 57 | resolve(flags); 58 | }); 59 | } 60 | 61 | function getApplicationContent(path) { 62 | 63 | } 64 | 65 | function decrypt (args) { 66 | let complete = 0; 67 | const result = []; 68 | const baseAddr = checkIsValidMacho(); 69 | console.log('[+] Decrypting application ' + module['name'] + ' at ' + baseAddr); 70 | 71 | 72 | console.log('[*] All Done!'); 73 | return; 74 | } 75 | 76 | function checkIsValidMacho() { 77 | let module = Process.enumerateModules()[0]; 78 | let baseAddr = module['base']; 79 | if (!isMachoHeaderAtOffset(baseAddr)) { 80 | console.error('[X] Not a Macho header at ' + baseAddr); 81 | return null; 82 | } 83 | return baseAddr; 84 | } 85 | 86 | function isMachoHeaderAtOffset(offset) { 87 | let cursor = trunc4k(offset); 88 | if (cursor.readU32() == 0xfeedfacf) { 89 | return true; 90 | } 91 | return false; 92 | } 93 | 94 | function parseMachoHeader(offset, flags) { 95 | console.log('[*] Parsing Macho header at addr: ' + offset); 96 | let header = { 97 | magic: offset.readU32(), 98 | cputype: offset.add(0x4).readU32(), 99 | cpusubtype: offset.add(0x8).readU32(), 100 | filetype: offset.add(0x0c).readU32(), 101 | ncmds: offset.add(0x10).readU32(), 102 | sizeofcmds: offset.add(0x14).readU32(), 103 | flags: offset.add(0x18).readU32(), 104 | }; 105 | if (header.cputype !== 0x0100000c) { 106 | console.error('[X] sorry not a 64-bit app'); 107 | return null; 108 | } 109 | flags.push({ 110 | name: 'macho_header', 111 | addr: offset 112 | }); 113 | return header; 114 | } 115 | 116 | function getSegments (baseAddr, ncmds, flags) { 117 | let cursor = baseAddr.add(0x20); 118 | let LC_SEGMENT_64 = 0x19; 119 | let segs = []; 120 | let slide = 0; 121 | while (ncmds-- > 0) { 122 | let command = cursor.readU32(); 123 | let cmdSize = cursor.add(4).readU32(); 124 | if (command !== LC_SEGMENT_64) { 125 | cursor = cursor.add(cmdSize); 126 | continue; 127 | } 128 | let seg = { 129 | name: cursor.add(0x8).readUtf8String(), 130 | vmaddr: cursor.add(0x18).readPointer(), 131 | vmsize: cursor.add(0x18).add(8).readPointer(), 132 | nsects: cursor.add(64).readU32(), 133 | sections: cursor.add(72) 134 | }; 135 | if (seg.name === '__TEXT') { 136 | slide = baseAddr.sub(seg.vmaddr); 137 | } 138 | cursor = cursor.add(cmdSize); 139 | segs.push(seg); 140 | } 141 | segs.forEach((seg) => { 142 | if (seg.name != '__PAGEZERO') { 143 | console.log('[*] Segment ' + seg.name + ' found at ' + seg.vmaddr); 144 | seg.vmaddr = seg.vmaddr.add(slide); 145 | seg.slide = slide; 146 | flags.push({ 147 | name: `segment.${seg.name}`, 148 | addr: seg.vmaddr 149 | }); 150 | } 151 | }); 152 | return segs; 153 | } 154 | 155 | function getSections (segment, flags) { 156 | let { nsects, sections, slide } = segment; 157 | const sects = []; 158 | while (nsects--) { 159 | sects.push({ 160 | name: sections.readUtf8String(), 161 | vmaddr: sections.add(32).readPointer().add(slide), 162 | vmsize: sections.add(40).readU64() 163 | }); 164 | sections = sections.add(80); 165 | } 166 | sects.forEach((section) => { 167 | console.log('[*] Section ' + section.name + ' found at ' + section.vmaddr); 168 | flags.push({ 169 | name: `section.${section.name}`, 170 | addr: section.vmaddr 171 | }); 172 | }); 173 | return sects; 174 | } 175 | 176 | function getEncryptionInfo(baseAddr, ncmds) { 177 | let cursor = baseAddr.add(0x20); 178 | let LC_ENCRYPTION_INFO_64 = 0x2C; 179 | let encryption_info = ""; 180 | while (ncmds-- > 0) { 181 | let command = cursor.readU32(); 182 | let cmdSize = cursor.add(4).readU32(); 183 | if (command !== LC_ENCRYPTION_INFO_64) { 184 | cursor = cursor.add(cmdSize); 185 | continue; 186 | } 187 | console.log('[*] Detected LC_ENCRYPTION_INFO_64 at ' + cursor); 188 | encryption_info = { 189 | cryptoff: cursor.add(0x8).readU32(), 190 | cryptsize: cursor.add(0xc).readU32(), 191 | cryptid: cursor.add(0x10).readU32(), 192 | }; 193 | cursor = cursor.add(cmdSize); 194 | } 195 | return encryption_info; 196 | } 197 | 198 | function trunc4k (x) { 199 | return x.and(ptr('0xfff').not()); 200 | } 201 | 202 | function copyApplication(source_path, destination_path) { 203 | return true; 204 | } 205 | 206 | function dump(moduleAddr, cryptoff, cryptsize) { 207 | const err = Memory.alloc(Process.pointerSize) 208 | const fileManager = ObjC.classes.NSFileManager.defaultManager() 209 | if (fileManager.fileExistsAtPath_(tmp)) 210 | fileManager.removeItemAtPath_error_(tmp, err) 211 | fileManager.copyItemAtPath_toPath_error_(module.path, tmp, err) 212 | const desc = Memory.readPointer(err) 213 | if (!desc.isNull()) { 214 | console.error(`failed to copy file: ${new ObjC.Object(desc).toString()}`) 215 | return null 216 | } 217 | 218 | const output = Memory.allocUtf8String(tmp) 219 | const outfd = open(output, O_RDWR, 0) 220 | const fatOffset = Process.findRangeByAddress(module.base).file.offset 221 | 222 | lseek(outfd, fatOffset + encryptionInfo.offset, SEEK_SET) 223 | write(outfd, module.base.add(encryptionInfo.offset), encryptionInfo.size) 224 | 225 | const zeros = Memory.alloc(12) 226 | lseek(outfd, fatOffset + encryptionInfo.fileoff + 8, SEEK_SET) 227 | write(outfd, zeros, 12) 228 | close(outfd) 229 | 230 | 231 | lseek(outfd, fatOffset + encryptionInfo.offset, SEEK_SET) 232 | write(outfd, module.base.add(encryptionInfo.offset), encryptionInfo.size) 233 | } -------------------------------------------------------------------------------- /iOS/examples/cfstring.js: -------------------------------------------------------------------------------- 1 | const specialChars = '`${}~|;#@&<> ()%":!'; 2 | 3 | const commands = { 4 | 'cfstringj': cfstringJSON, 5 | 'cfstring*': cfstringR2 6 | }; 7 | 8 | r2frida.pluginRegister('cfstring', function (name) { 9 | return commands[name]; 10 | }); 11 | 12 | function cfstringJSON (args) { 13 | let complete = 0; 14 | const result = []; 15 | return new Promise((resolve, reject) => { 16 | r2frida.hostCmd('?v $$').then(res => { 17 | const header = headerFromOffset(ptr(res)); 18 | console.log('header at', header); 19 | const segs = getSegments(header); 20 | for (const seg of segs) { 21 | if (seg.name === '__DATA') { 22 | const sects = getSections(seg); 23 | for (const sect of sects) { 24 | if (sect.name === '__cfstring') { 25 | parseCFString(sect, result); 26 | if (complete++ === 1) { 27 | resolve(result); 28 | return; 29 | } 30 | } else if (sect.name === '__objc_selrefs') { 31 | parseSelRefs(sect, result); 32 | if (complete++ === 1) { 33 | resolve(result); 34 | return; 35 | } 36 | } 37 | } 38 | break; 39 | } 40 | } 41 | 42 | resolve(result); 43 | }).catch(reject); 44 | }); 45 | } 46 | 47 | function cfstringR2 (args) { 48 | return cfstringJSON(args).then(strs => { 49 | return strs.map(str => { 50 | if (str.cstring !== undefined) { 51 | return `f str.cstr.${sanitizeString(str.value)} ${str.length} ${str.address}`; 52 | } else { 53 | return `f str.sel.${sanitizeString(str.value)} ${str.length} ${str.address}`; 54 | } 55 | }).join('\n'); 56 | }); 57 | } 58 | 59 | function sanitizeString (str) { 60 | return str.split('').map(c => specialChars.indexOf(c) === -1 ? c : '_').join('').replace(/\s+/g, ''); 61 | } 62 | 63 | function parseCFString (sect, result) { 64 | let cursor = sect.vmaddr; 65 | const end = cursor.add(sect.vmsize); 66 | while (cursor.compare(end) < 0) { 67 | if (cursor.readPointer().equals(ptr('0x00000000000007c8'))) { 68 | result.push({ 69 | address: cursor.sub(8), 70 | value: cursor.add(8).readPointer().readUtf8String(), 71 | cstring: cursor.add(8).readPointer(), 72 | length: cursor.add(16).readU32() 73 | }); 74 | cursor = cursor.add(24); 75 | } else { 76 | cursor = cursor.add(8); 77 | } 78 | } 79 | } 80 | 81 | function parseSelRefs (sect, result) { 82 | let cursor = sect.vmaddr; 83 | const end = cursor.add(sect.vmsize); 84 | while (cursor.compare(end) < 0) { 85 | try { 86 | const selPtr = cursor.readPointer(); 87 | const value = selPtr.readUtf8String(); 88 | result.push({ 89 | address: cursor, 90 | value, 91 | length: value.length 92 | }); 93 | } catch (e) { 94 | } 95 | cursor = cursor.add(Process.pointerSize); 96 | } 97 | } 98 | 99 | function headerFromOffset (off) { 100 | let cursor = trunc4k(off); 101 | while (cursor.readU32() !== 0xfeedfacf) { 102 | cursor = cursor.sub(0x1000); 103 | } 104 | return cursor; 105 | } 106 | 107 | function getSegments (header) { 108 | var ncmds = header.add(0x10).readU32(); 109 | var cursor = header.add(0x20); 110 | var cputype = header.add(4).readU32(); 111 | if (cputype !== 0x0100000c) { 112 | console.log('sorry not a 64-bit app'); 113 | return []; 114 | } 115 | 116 | var LC_SEGMENT_64 = 0x19; 117 | var segs = []; 118 | var slide = 0; 119 | 120 | while (ncmds-- > 0) { 121 | var command = cursor.readU32(); 122 | var cmdSize = cursor.add(4).readU32(); 123 | 124 | if (command !== LC_SEGMENT_64) { 125 | cursor = cursor.add(cmdSize); 126 | continue; 127 | } 128 | 129 | var seg = { 130 | name: cursor.add(8).readUtf8String(), 131 | vmaddr: cursor.add(0x18).readPointer(), 132 | vmsize: cursor.add(0x18).add(8).readPointer(), 133 | nsects: cursor.add(64).readU32(), 134 | sections: cursor.add(72) 135 | }; 136 | 137 | if (seg.name === '__TEXT') { 138 | slide = header.sub(seg.vmaddr); 139 | } 140 | 141 | segs.push(seg); 142 | cursor = cursor.add(cmdSize); 143 | } 144 | 145 | segs.forEach((seg) => { 146 | seg.vmaddr += slide; 147 | seg.slide = slide; 148 | }); 149 | 150 | return segs; 151 | } 152 | 153 | function getSections (segment) { 154 | let { nsects, sections, slide } = segment; 155 | const sects = []; 156 | while (nsects--) { 157 | sects.push({ 158 | name: sections.readUtf8String(), 159 | vmaddr: sections.add(32).readPointer().add(slide), 160 | vmsize: sections.add(40).readU64() 161 | }); 162 | sections = sections.add(80); 163 | } 164 | return sects; 165 | } 166 | 167 | function trunc4k (x) { 168 | return x.and(ptr('0xfff').not()); 169 | } 170 | 171 | /* globals ptr, r2frida */ 172 | -------------------------------------------------------------------------------- /iOS/examples/heap.js: -------------------------------------------------------------------------------- 1 | 'use strict'; 2 | 3 | r2frida.pluginRegister('heap', function (commandName) { 4 | if (commandName === 'choose') { 5 | return function (args) { 6 | var query = ObjC.classes[args[0]]; 7 | return ObjC.chooseSync(query) 8 | .map(function (match) { 9 | return match; 10 | }).join('\n'); 11 | } 12 | } 13 | }); -------------------------------------------------------------------------------- /iOS/examples/hello.js: -------------------------------------------------------------------------------- 1 | 'use strict'; 2 | 3 | const commands = { 4 | 'hello': hello 5 | }; 6 | 7 | r2frida.pluginRegister('hello', function (name) { 8 | return commands[name]; 9 | }); 10 | 11 | const ObjCAvailable = (Process.platform === 'darwin') && ObjC && ObjC.available && ObjC.classes && typeof ObjC.classes.NSString !== 'undefined'; 12 | 13 | async function hello(args) { 14 | if (!ObjCAvailable) { 15 | return 'Error: Not implemented for this platform'; 16 | } 17 | const title = 'r2con 2021'; 18 | const message = 'Hello r2con!' 19 | ObjC.schedule(ObjC.mainQueue, function () { 20 | const UIAlertView = ObjC.classes.UIAlertView; /* iOS 7 */ 21 | const view = UIAlertView.alloc().initWithTitle_message_delegate_cancelButtonTitle_otherButtonTitles_( 22 | title, 23 | message, 24 | NULL, 25 | 'OK', 26 | NULL); 27 | view.show(); 28 | view.release(); 29 | }); 30 | } 31 | -------------------------------------------------------------------------------- /iOS/examples/resolver.js: -------------------------------------------------------------------------------- 1 | 'use strict'; 2 | 3 | r2frida.pluginRegister('resolver', function (commandName) { 4 | if (commandName === 'find') { 5 | return function (args) { 6 | var query = args.join(' '); 7 | return new ApiResolver('objc').enumerateMatchesSync(query) 8 | .map(function (match) { 9 | return match.address + '\t' + match.name; 10 | }).join('\n'); 11 | } 12 | } 13 | }); -------------------------------------------------------------------------------- /iOS/jbdetection/disable_jbdetection.js: -------------------------------------------------------------------------------- 1 | 'use strict'; 2 | 3 | const nativeFuncs = [ 4 | "access", 5 | "lstat" 6 | ]; 7 | 8 | const jailbreakPaths = [ 9 | "/etc/apt", 10 | "/Library/MobileSubstrate/MobileSubstrate.dylib", 11 | "/Applications/Cydia.app", 12 | "/Applications/blackra1n.app", 13 | "/Applications/FakeCarrier.app", 14 | "/Applications/Icy.app", 15 | "/Applications/IntelliScreen.app", 16 | "/Applications/MxTube.app", 17 | "/Applications/RockApp.app", 18 | "/Applications/SBSetttings.app", 19 | "/Applications/WinterBoard.app", 20 | "/usr/sbin/sshd", 21 | "/private/var/tmp/cydia.log", 22 | "/usr/binsshd", 23 | "/usr/libexec/sftp-server", 24 | "/Systetem/Library/LaunchDaemons/com.ikey.bbot.plist", 25 | "/System/Library/LaunchDaemons/com.saurik.Cy@dia.Startup.plist", 26 | "/var/log/syslog", 27 | "/bin/bash", 28 | "/bin/sh", 29 | "/etc/ssh/sshd_config", 30 | "/usr/libexec/ssh-keysign", 31 | "/Library/MobileSubstrate/DynamicLibraries/LiveClock.plist", 32 | "/Library/MobileSubstrate/DynamicLibraries/Veency.plist", 33 | "/private/var/lib/apt", 34 | "/private/var/lib/apt/", 35 | "/private/var/lib/cydia", 36 | "/private/var/mobile/Library/SBSettings/Themes", 37 | "/private/var/stash", 38 | "/System/Library/LaunchDaemons/com.ikey.bbot.plist", 39 | "/System/Library/LaunchDaemons/com.saurik.Cydia.Startup.plist", 40 | "/usr/libexec/sftp-server", 41 | "/Library/dpkg/info/kjc.checkra1n.mobilesubstraterepo.list" 42 | ]; 43 | 44 | 45 | const commands = { 46 | 'disable_jbdetection':disableJB 47 | }; 48 | 49 | r2frida.pluginRegister('disable_jbdetection', function (name) { 50 | return commands[name]; 51 | }); 52 | 53 | function disableJB() { 54 | bypassNativeFuncs (); 55 | if(ObjC.available) { 56 | console.log("Jailbreak Detection enabled"); 57 | for(let className in ObjC.classes) { 58 | if (ObjC.classes.hasOwnProperty(className)) { 59 | //Jailbreak detection via accessing special files 60 | if(className == "NSFileManager") { 61 | console.log("Found our target class : " + className); 62 | let hook = ObjC.classes.NSFileManager["- fileExistsAtPath:"]; 63 | Interceptor.attach(hook.implementation, { 64 | onEnter: function (args) { 65 | let path = ObjC.Object(args[2]).toString(); // NSString 66 | this.jailbreakCall = false; 67 | let i = jailbreakPaths.length; 68 | while (i--) { 69 | let splittedJbPath = jailbreakPaths[i].split('/'); 70 | let forbiddenBinary = "invalid"; 71 | if (splittedJbPath.length > 0) { 72 | forbiddenBinary = splittedJbPath[splittedJbPath.length - 1]; 73 | } 74 | if (jailbreakPaths[i] == path || (forbiddenBinary.length > 0 && path.includes(forbiddenBinary))) { 75 | console.log(`Jailbreak detection => Trying to read forbidden path: ${path}`); 76 | this.jailbreakCall = true; 77 | } 78 | } 79 | }, 80 | onLeave: function (retval) { 81 | if(this.jailbreakCall) { 82 | retval.replace(0x00); 83 | console.log("Jailbreak detection bypassed!"); 84 | } 85 | } 86 | }); 87 | } 88 | //Jailbreak detection via writing to forbidden paths 89 | if(className == "NSString") { 90 | console.log("Found our target class : " + className); 91 | 92 | let hook = ObjC.classes.NSString["- writeToFile:atomically:encoding:error:"]; 93 | Interceptor.attach(hook.implementation, { 94 | onEnter: function (args) { 95 | let path = ObjC.Object(args[2]).toString(); // NSString 96 | 97 | if (path.indexOf("private") >= 0) { 98 | console.log("Jailbreak detection => Trying to write path: "+path); 99 | this.jailbreakCall = true; 100 | this.error = args[5]; 101 | } 102 | }, 103 | onLeave: function (retval) { 104 | if(this.jailbreakCall) { 105 | let error = ObjC.classes.NSError.alloc(); 106 | Memory.writePointer(this.error, error); 107 | console.log("Jailbreak detection bypassed!"); 108 | } 109 | } 110 | }); 111 | } 112 | //Jailbreak detection via cydia URL Schema 113 | if(className == "UIApplication") { 114 | console.log("Found our target class : " + className); 115 | 116 | let hook = ObjC.classes.UIApplication["- canOpenURL:"]; 117 | Interceptor.attach(hook.implementation, { 118 | onEnter: function (args) { 119 | let url = ObjC.Object(args[2]).toString(); // NSString 120 | console.log("URL : " + url); 121 | 122 | if (url.indexOf("cydia") >= 0) { 123 | console.log("Jailbreak detection => Trying to use Cydia URL Schema: "+url); 124 | this.jailbreakCall = true; 125 | } 126 | }, 127 | onLeave: function (retval) { 128 | if(this.jailbreakCall) { 129 | retval.replace(0x00); 130 | console.log("Jailbreak detection bypassed!"); 131 | } 132 | } 133 | }); 134 | } 135 | } 136 | } 137 | } else { 138 | console.log("Objective-C Runtime is not available!"); 139 | } 140 | } 141 | 142 | function bypassNativeFuncs () { 143 | nativeFuncs.forEach(function(nativeFunc) { 144 | Interceptor.attach(Module.findExportByName("libSystem.B.dylib", nativeFunc), { 145 | onEnter: function (args) { 146 | let path = Memory.readCString(ptr(args[0])); 147 | let i = jailbreakPaths.length; 148 | while (i--) { 149 | if (jailbreakPaths[i] == path) { 150 | console.log(`Jailbreak detection => Trying to read path: ${path} using ${nativeFunc}`); 151 | this.jailbreakCall = true; 152 | } 153 | } 154 | }, 155 | onLeave: function (retval) { 156 | if(this.jailbreakCall) { 157 | retval.replace(0xffffffff); 158 | console.log("Native Jailbreak detection bypassed!"); 159 | } 160 | } 161 | }); 162 | }); 163 | } 164 | -------------------------------------------------------------------------------- /iOS/sslpinning/afn_pinning.js: -------------------------------------------------------------------------------- 1 | 'use strict'; 2 | 3 | const commands = { 4 | 'disable_afn_pinning':disablePinning 5 | }; 6 | 7 | r2frida.pluginRegister('afnpinning', function (name) { 8 | return commands[name]; 9 | }); 10 | 11 | 12 | async function disablePinning (args) { 13 | disableValidatesDomainName(); 14 | setAllowInvalidCertificates(); 15 | pinnedCertificatesToNull(); 16 | setPolicyWithPinningModeToNone(); 17 | setSSLPinningModeNull(); 18 | 19 | // One-Shot Hook 20 | //disableEvaluateServerTrust(); 21 | } 22 | 23 | function disableEvaluateServerTrust () { 24 | var resolver = new ApiResolver('objc'); 25 | var matches = resolver.enumerateMatchesSync("-[AFSecurityPolicy evaluateServerTrust:forDomain:]"); 26 | if (matches.lenght == 0) { 27 | return; 28 | } 29 | Interceptor.attach( 30 | ptr(matches[0]["address"]), 31 | { 32 | onLeave: function(retval) { 33 | console.log("[*] -[AFSecurityPolicy evaluateServerTrust:forDomain:] hits!"); 34 | retval.replace(ptr(0x01)); 35 | } 36 | } 37 | ); 38 | } 39 | 40 | function pinnedCertificatesToNull () { 41 | var AFSecurityPolicy = ObjC.classes["AFSecurityPolicy"]; 42 | Interceptor.attach( 43 | AFSecurityPolicy["- setPinnedCertificates:"].implementation, { 44 | onEnter(args) { 45 | if (!args[2].isNull()) { 46 | console.log("Replacing AFSecurityPolicy setPinnedCertificates: = nil "); 47 | args[2] = new NativePointer(0x0); //AFSSLPinningModeNone 48 | } 49 | } 50 | } 51 | ); 52 | } 53 | 54 | // -[AFSecurityPolicy setValidatesDomainName:] 55 | function disableValidatesDomainName (){ 56 | var AFSecurityPolicy = ObjC.classes["AFSecurityPolicy"]; 57 | Interceptor.attach( 58 | AFSecurityPolicy["- setValidatesDomainName:"].implementation, { 59 | onEnter(args) { 60 | if (!args[2].isNull()) { 61 | console.log("Replacing AFSecurityPolicy - setValidatesDomainName: = NO "); 62 | args[2] = new NativePointer(0x0); 63 | } 64 | } 65 | } 66 | ); 67 | } 68 | 69 | // -[AFSecurityPolicy setSSLPinningMode:] 70 | function setSSLPinningModeNull () { 71 | var AFSecurityPolicy = ObjC.classes["AFSecurityPolicy"]; 72 | Interceptor.attach( 73 | AFSecurityPolicy["- setSSLPinningMode:"].implementation, { 74 | onEnter(args) { 75 | if (!args[2].isNull()) { 76 | console.log("Replacing AFSecurityPolicy setSSLPinningMode = AFSSLPinningModeNone "); 77 | args[2] = new NativePointer(0x0); //AFSSLPinningModeNone 78 | } 79 | } 80 | } 81 | ); 82 | } 83 | 84 | // -[AFSecurityPolicy setAllowInvalidCertificates:] 85 | function setAllowInvalidCertificates () { 86 | var AFSecurityPolicy = ObjC.classes["AFSecurityPolicy"]; 87 | Interceptor.attach( 88 | AFSecurityPolicy["- setAllowInvalidCertificates:"].implementation, { 89 | onEnter(args) { 90 | // setAllowInvalidCertificates == NO 91 | if (args[2].equals(new NativePointer(0x0))) { 92 | console.log("Replacing AFSecurityPolicy setAllowInvalidCertificates = YES "); 93 | args[2] = new NativePointer(0x1); 94 | } 95 | } 96 | } 97 | ); 98 | } 99 | 100 | // +[AFSecurityPolicy policyWithPinningMode:] 101 | // +[AFSecurityPolicy policyWithPinningMode:withPinnedCertificates:] 102 | function setPolicyWithPinningModeToNone () { 103 | var AFSecurityPolicy = ObjC.classes["AFSecurityPolicy"]; 104 | Interceptor.attach( 105 | AFSecurityPolicy["+ policyWithPinningMode:"].implementation, { 106 | onEnter(args) { 107 | if (!args[2].isNull()) { 108 | console.log("Replacing AFSecurityPolicy policyWithPinningMode = AFSSLPinningModeNone "); 109 | args[2] = new NativePointer(0x0); 110 | } 111 | } 112 | } 113 | ); 114 | if (AFSecurityPolicy["+ policyWithPinningMode:withPinnedCertificates:"]) { 115 | Interceptor.attach( 116 | AFSecurityPolicy["+ policyWithPinningMode:withPinnedCertificates:"].implementation, { 117 | onEnter(args) { 118 | if (!args[2].isNull()) { 119 | console.log("Replacing AFSecurityPolicy policyWithPinningMode:withPinnedCertificates: = AFSSLPinningModeNone "); 120 | args[2] = new NativePointer(0x0); 121 | } 122 | } 123 | } 124 | ); 125 | } 126 | } -------------------------------------------------------------------------------- /iOS/sslpinning/afn_trace.r2: -------------------------------------------------------------------------------- 1 | :e hook.backtrace=false 2 | :dtf objc:AFSecurityPolicy.setSSLPinningMode:$ xxx 3 | :dtf objc:AFSecurityPolicy.setAllowInvalidCertificates:$ xxx 4 | :dtf objc:AFSecurityPolicy.policyWithPinningMode:$ xxx 5 | :dtf objc:AFSecurityPolicy.setValidatesDomainName:$ xxx 6 | :dtf objc:AFSecurityPolicy.setPinnedCertificates: xxx -------------------------------------------------------------------------------- /iOS/sslpinning/boringssl_pinning.js: -------------------------------------------------------------------------------- 1 | /* Description: iOS 13 SSL Bypass based on https://codeshare.frida.re/@federicodotta/ios13-pinning-bypass/ 2 | and https://medium.com/@macho_reverser/bypassing-certificate-pinning-on-ios-12-with-frida-809acdb875e7 3 | */ 4 | 5 | const commands = { 6 | 'disable_ssl_pinning':disablePinning 7 | }; 8 | 9 | r2frida.pluginRegister('sslpinning', function (name) { 10 | return commands[name]; 11 | }); 12 | 13 | async function disablePinning (args) { 14 | try { 15 | Module.ensureInitialized("libboringssl.dylib"); 16 | } catch(err) { 17 | console.log("libboringssl.dylib module not loaded. Trying to manually load it.") 18 | Module.load("libboringssl.dylib"); 19 | } 20 | 21 | var SSL_VERIFY_NONE = 0; 22 | var ssl_set_custom_verify; 23 | var ssl_get_psk_identity; 24 | 25 | ssl_set_custom_verify = new NativeFunction( 26 | Module.findExportByName("libboringssl.dylib", "SSL_set_custom_verify"), 27 | 'void', ['pointer', 'int', 'pointer'] 28 | ); 29 | 30 | ssl_get_psk_identity = new NativeFunction( 31 | Module.findExportByName("libboringssl.dylib", "SSL_get_psk_identity"), 32 | 'pointer', ['pointer'] 33 | ); 34 | 35 | function custom_verify_callback_that_does_not_validate(ssl, out_alert){ 36 | return SSL_VERIFY_NONE; 37 | } 38 | 39 | var ssl_verify_result_t = new NativeCallback(function (ssl, out_alert){ 40 | custom_verify_callback_that_does_not_validate(ssl, out_alert); 41 | },'int',['pointer','pointer']); 42 | 43 | Interceptor.replace(ssl_set_custom_verify, new NativeCallback(function(ssl, mode, callback) { 44 | ssl_set_custom_verify(ssl, mode, ssl_verify_result_t); 45 | }, 'void', ['pointer', 'int', 'pointer'])); 46 | 47 | Interceptor.replace(ssl_get_psk_identity, new NativeCallback(function(ssl) { 48 | return "notarealPSKidentity"; 49 | }, 'pointer', ['pointer'])); 50 | } -------------------------------------------------------------------------------- /iOS/sslpinning/bypass_afn.r2: -------------------------------------------------------------------------------- 1 | :di1 objc:AFSecurityPolicy.evaluateServerTrust:forDomain:$ -------------------------------------------------------------------------------- /iOS/sslpinning/http_trace.r2: -------------------------------------------------------------------------------- 1 | :dtf objc:NSURL.^URLWithString:$ OOO 2 | :dtf `:ic NSMutableURLRequest~setHTTPBody:0[0]` OOO 3 | :dtf objc:NSURLSession.^uploadTaskWithRequest:fromData:completionHandler:$ OOOOO 4 | :dtf objc:NSURLSession.^downloadTaskWithRequest:completionHandler:$ OOOO 5 | :dtf objc:NSURLSession.^dataTaskWithRequest:completionHandler:$ OOOO 6 | :dtf objc:NSURLSession.^dataTaskWithRequest:$ OOO 7 | :e hook.output=json 8 | :e hook.backtrace=false -------------------------------------------------------------------------------- /iOS/sslpinning/log_ssl_keys.js: -------------------------------------------------------------------------------- 1 | /** 2 | * Dumps TLS v1.2 and v1.3 keys in the NSS key log format (https://developer.mozilla.org/en-US/docs/Mozilla/Projects/NSS/Key_Log_Format). 3 | * 4 | * This script is based on the work of Hugo Tunius, @k0nser: https://hugotunius.se/2020/08/07/stealing-tls-sessions-keys-from-ios-apps.html 5 | * 6 | */ 7 | 8 | 'use strict'; 9 | 10 | function log_key(ssl, line) { 11 | const s_line = new NativePointer(line).readCString(); 12 | console.log(s_line); 13 | const msg = { 14 | 'type': 'ssl_key_log', 15 | 'dump': 'sslkeylog.txt', 16 | 'data': s_line 17 | } 18 | console.log(msg); 19 | } 20 | 21 | 22 | function _log_ssl_keys(SSL_CTX_new, SSL_CTX_set_keylog_callback) { 23 | 24 | const keylogCallback = new NativeCallback(log_key, 'void', ['pointer', 'pointer']) 25 | Interceptor.attach(SSL_CTX_new, { 26 | onLeave: function(retval) { 27 | const ssl = new NativePointer(retval); 28 | if (!ssl.isNull()) { 29 | const SSL_CTX_set_keylog_callbackFn = new NativeFunction(SSL_CTX_set_keylog_callback, 'void', ['pointer', 'pointer']); 30 | SSL_CTX_set_keylog_callbackFn(ssl, keylogCallback); 31 | } 32 | } 33 | }); 34 | } 35 | 36 | function log_ssl_keys() { 37 | _log_ssl_keys( 38 | Module.findExportByName('libboringssl.dylib', 'SSL_CTX_new'), 39 | Module.findExportByName('libboringssl.dylib', 'SSL_CTX_set_msg_callback') 40 | ); 41 | } 42 | 43 | const commands = { 44 | 'log_ssl_keys': log_ssl_keys 45 | }; 46 | 47 | try { 48 | r2frida.pluginRegister('log_ssl_keys', function (name) { 49 | return commands[name]; 50 | }); 51 | } catch (e) {} 52 | 53 | -------------------------------------------------------------------------------- /iOS/sslpinning/log_ssl_keys.r2: -------------------------------------------------------------------------------- 1 | :. log_ssl_keys.js 2 | :log_ssl_keys 3 | -------------------------------------------------------------------------------- /iOS/sslpinning/nsurl_pinning.js: -------------------------------------------------------------------------------- 1 | 'use strict'; 2 | 3 | const commands = { 4 | 'disable_nsurl_pinning':disablePinning 5 | }; 6 | 7 | r2frida.pluginRegister('nsurlpinning', function (name) { 8 | return commands[name]; 9 | }); 10 | 11 | 12 | async function disablePinning (args) { 13 | const NSURLCredential = ObjC.classes.NSURLCredential; 14 | const resolver = new ApiResolver("objc"); 15 | resolver.enumerateMatches( "-[* URLSession:didReceiveChallenge:completionHandler:]", { 16 | onMatch: function (i) { 17 | console.log('Found NSURLSession based classes.'); 18 | 19 | Interceptor.attach(i.address, { 20 | onEnter(args) { 21 | const receiver = new ObjC.Object(args[0]); 22 | const selector = ObjC.selectorAsString(args[1]); 23 | 24 | console.log(`-[${receiver} ${selector}] Hooked`); 25 | const challenge = new ObjC.Object(args[3]); 26 | 27 | const completionHandler = new ObjC.Block(args[4]); 28 | const savedCompletionHandler = completionHandler.implementation; 29 | const NSURLSessionAuthChallengeUseCredential = 0 30 | 31 | completionHandler.implementation = function() {  32 | console.log("Modified completionHandler called."); 33 | const credential = NSURLCredential.credentialForTrust_(challenge.protectionSpace().serverTrust()); 34 | challenge.sender().useCredential_forAuthenticationChallenge_(credential, challenge); 35 | 36 | savedCompletionHandler(NSURLSessionAuthChallengeUseCredential, credential); 37 | }; 38 | }}); 39 | }, 40 | onComplete: function () { 41 | } 42 | }); 43 | } 44 | 45 | 46 | 47 | -------------------------------------------------------------------------------- /iOS/sslpinning/nsurl_trace.r2: -------------------------------------------------------------------------------- 1 | :dt objc:NSURLSession.dataTaskWithRequest:completionHandler:$ 2 | :dt objc:NSURLSession.dataTaskWithURL:completionHandler:$ 3 | -------------------------------------------------------------------------------- /iOS/url_schema/urlschema_fuzz.js: -------------------------------------------------------------------------------- 1 | /* 2 | * r2frida Plugin based on https://codeshare.frida.re/@dki/ios-url-scheme-fuzzing/ 3 | * 4 | * iOS URL Scheme Fuzzing 5 | * 6 | */ 7 | 8 | var fuzzStrings = ["0", 9 | "1", 10 | "-1", 11 | "null", 12 | "nil", 13 | "99999999999999999999999999999999999", 14 | Array(257).join("A"), 15 | Array(1026).join("A"), 16 | "'", 17 | "%20d", 18 | "%20n", 19 | "%20x", 20 | "%20s" 21 | ]; 22 | 23 | const commands = { 24 | fuzz: fuzz, 25 | openURL: openURL, 26 | bundleExecutableForScheme: bundleExecutableForScheme 27 | }; 28 | 29 | r2frida.pluginRegister('schema_fuzz', function (name) { 30 | return commands[name]; 31 | }); 32 | 33 | function openURL(args) { 34 | return _openURL(args[0]); 35 | } 36 | 37 | function bundleExecutableForScheme(args) { 38 | return _bundleExecutableForScheme(args[0]); 39 | } 40 | 41 | function _openURL(url) { 42 | var w = ObjC.classes.LSApplicationWorkspace.defaultWorkspace(); 43 | var toOpen = ObjC.classes.NSURL.URLWithString_(url); 44 | return w.openSensitiveURL_withOptions_(toOpen, null); 45 | } 46 | 47 | function _bundleExecutableForScheme(scheme) { 48 | var apps = ObjC.classes.LSApplicationWorkspace.defaultWorkspace().applicationsAvailableForHandlingURLScheme_(scheme); 49 | console.log(apps); 50 | if (apps.count() != 1) { 51 | return null; 52 | } 53 | 54 | var appProxy = apps.objectAtIndex_(0); // LSApplicationProxy 55 | var bundleExecutable = appProxy.bundleExecutable(); 56 | if (bundleExecutable !== null) { 57 | return bundleExecutable.toString(); 58 | } 59 | 60 | return null; 61 | } 62 | 63 | function homeSinglePress() { 64 | ObjC.schedule(ObjC.mainQueue, function() { 65 | ObjC.classes.SBUIController.sharedInstance().handleHomeButtonSinglePressUp(); 66 | }); 67 | } 68 | 69 | // https://stackoverflow.com/questions/610406/javascript-equivalent-to-printf-string-format 70 | if (!String.format) { 71 | String.format = function(format) { 72 | var args = Array.prototype.slice.call(arguments, 1); 73 | return format.replace(/{(\d+)}/g, function(match, number) { 74 | return typeof args[number] != 'undefined' ? 75 | args[number] : 76 | match; 77 | }); 78 | }; 79 | } 80 | 81 | fuzzStrings.iter = function() { 82 | var index = 0; 83 | var data = this; 84 | return { 85 | next: function() { 86 | return { 87 | value: data[index], 88 | done: index++ == (data.length - 1) 89 | }; 90 | }, 91 | hasNext: function() { 92 | return index < data.length; 93 | } 94 | } 95 | }; 96 | 97 | // check for crash logs and move them to /tmp/ if they exist 98 | function moveCrashLogs(appname) { 99 | var match = appname + "*.ips"; 100 | var pred = ObjC.classes.NSPredicate.predicateWithFormat_('SELF like "' + match + '"'); 101 | var fm = ObjC.classes.NSFileManager.defaultManager(); 102 | var dirlist = fm.contentsOfDirectoryAtPath_error_("/private/var/mobile/Library/Logs/CrashReporter", NULL); 103 | var results = dirlist.filteredArrayUsingPredicate_(pred); 104 | if (results.count() > 0) { 105 | for (var i = 0; i < results.count(); i++) { 106 | var src = results.objectAtIndex_(i).toString(); 107 | fm.moveItemAtPath_toPath_error_("/private/var/mobile/Library/Logs/CrashReporter/" + src, "/tmp/" + src, NULL); 108 | console.log('Crash detected - ' + src); 109 | } 110 | return true; 111 | } 112 | return false; 113 | } 114 | 115 | function fuzz(args) { 116 | url = args[0]; 117 | var appname = _bundleExecutableForScheme(url.split(':')[0]); 118 | if (appname === null) { 119 | console.log("Could not determine which app handles this URL!"); 120 | return; 121 | } 122 | 123 | function Fuzzer(url, appname, iter) { 124 | this.url = url; 125 | this.appname = appname; 126 | this.iter = iter; 127 | } 128 | 129 | Fuzzer.prototype.checkForCrash = function(done) { 130 | homeSinglePress(); 131 | moveCrashLogs(this.appname) 132 | if (!done) { 133 | this.fuzz(); 134 | } 135 | }; 136 | 137 | Fuzzer.prototype.fuzz = function() { 138 | var term = this.iter.next(); 139 | var fuzzedURL = String.format(this.url, term.value); 140 | if (_openURL(fuzzedURL)) { 141 | console.log("Opened URL: " + fuzzedURL); 142 | } else { 143 | console.log("URL refused by SpringBoard: " + fuzzedURL); 144 | } 145 | ObjC.classes.NSThread.sleepForTimeInterval_(3); 146 | this.checkForCrash(term.done); 147 | }; 148 | 149 | console.log("Watching for crashes from " + appname + "..."); 150 | 151 | if (moveCrashLogs(appname)) { 152 | console.log("Moved one or more logs to /tmp/ before fuzzing!"); 153 | } 154 | var iter = fuzzStrings.iter(); 155 | var fuzzer = new Fuzzer(url, appname, iter); 156 | fuzzer.fuzz(); 157 | } 158 | 159 | --------------------------------------------------------------------------------