├── LICENSE ├── README.md ├── sha256_pkg.sql └── sha256_pkgbody.sql /LICENSE: -------------------------------------------------------------------------------- 1 | GNU LESSER GENERAL PUBLIC LICENSE 2 | Version 2.1, February 1999 3 | 4 | Copyright (C) 1991, 1999 Free Software Foundation, Inc. 5 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 6 | Everyone is permitted to copy and distribute verbatim copies 7 | of this license document, but changing it is not allowed. 8 | 9 | [This is the first released version of the Lesser GPL. It also counts 10 | as the successor of the GNU Library Public License, version 2, hence 11 | the version number 2.1.] 12 | 13 | Preamble 14 | 15 | The licenses for most software are designed to take away your 16 | freedom to share and change it. By contrast, the GNU General Public 17 | Licenses are intended to guarantee your freedom to share and change 18 | free software--to make sure the software is free for all its users. 19 | 20 | This license, the Lesser General Public License, applies to some 21 | specially designated software packages--typically libraries--of the 22 | Free Software Foundation and other authors who decide to use it. You 23 | can use it too, but we suggest you first think carefully about whether 24 | this license or the ordinary General Public License is the better 25 | strategy to use in any particular case, based on the explanations below. 26 | 27 | When we speak of free software, we are referring to freedom of use, 28 | not price. Our General Public Licenses are designed to make sure that 29 | you have the freedom to distribute copies of free software (and charge 30 | for this service if you wish); that you receive source code or can get 31 | it if you want it; that you can change the software and use pieces of 32 | it in new free programs; and that you are informed that you can do 33 | these things. 34 | 35 | To protect your rights, we need to make restrictions that forbid 36 | distributors to deny you these rights or to ask you to surrender these 37 | rights. These restrictions translate to certain responsibilities for 38 | you if you distribute copies of the library or if you modify it. 39 | 40 | For example, if you distribute copies of the library, whether gratis 41 | or for a fee, you must give the recipients all the rights that we gave 42 | you. You must make sure that they, too, receive or can get the source 43 | code. If you link other code with the library, you must provide 44 | complete object files to the recipients, so that they can relink them 45 | with the library after making changes to the library and recompiling 46 | it. And you must show them these terms so they know their rights. 47 | 48 | We protect your rights with a two-step method: (1) we copyright the 49 | library, and (2) we offer you this license, which gives you legal 50 | permission to copy, distribute and/or modify the library. 51 | 52 | To protect each distributor, we want to make it very clear that 53 | there is no warranty for the free library. Also, if the library is 54 | modified by someone else and passed on, the recipients should know 55 | that what they have is not the original version, so that the original 56 | author's reputation will not be affected by problems that might be 57 | introduced by others. 58 | 59 | Finally, software patents pose a constant threat to the existence of 60 | any free program. We wish to make sure that a company cannot 61 | effectively restrict the users of a free program by obtaining a 62 | restrictive license from a patent holder. Therefore, we insist that 63 | any patent license obtained for a version of the library must be 64 | consistent with the full freedom of use specified in this license. 65 | 66 | Most GNU software, including some libraries, is covered by the 67 | ordinary GNU General Public License. This license, the GNU Lesser 68 | General Public License, applies to certain designated libraries, and 69 | is quite different from the ordinary General Public License. We use 70 | this license for certain libraries in order to permit linking those 71 | libraries into non-free programs. 72 | 73 | When a program is linked with a library, whether statically or using 74 | a shared library, the combination of the two is legally speaking a 75 | combined work, a derivative of the original library. The ordinary 76 | General Public License therefore permits such linking only if the 77 | entire combination fits its criteria of freedom. The Lesser General 78 | Public License permits more lax criteria for linking other code with 79 | the library. 80 | 81 | We call this license the "Lesser" General Public License because it 82 | does Less to protect the user's freedom than the ordinary General 83 | Public License. It also provides other free software developers Less 84 | of an advantage over competing non-free programs. These disadvantages 85 | are the reason we use the ordinary General Public License for many 86 | libraries. However, the Lesser license provides advantages in certain 87 | special circumstances. 88 | 89 | For example, on rare occasions, there may be a special need to 90 | encourage the widest possible use of a certain library, so that it becomes 91 | a de-facto standard. To achieve this, non-free programs must be 92 | allowed to use the library. A more frequent case is that a free 93 | library does the same job as widely used non-free libraries. In this 94 | case, there is little to gain by limiting the free library to free 95 | software only, so we use the Lesser General Public License. 96 | 97 | In other cases, permission to use a particular library in non-free 98 | programs enables a greater number of people to use a large body of 99 | free software. For example, permission to use the GNU C Library in 100 | non-free programs enables many more people to use the whole GNU 101 | operating system, as well as its variant, the GNU/Linux operating 102 | system. 103 | 104 | Although the Lesser General Public License is Less protective of the 105 | users' freedom, it does ensure that the user of a program that is 106 | linked with the Library has the freedom and the wherewithal to run 107 | that program using a modified version of the Library. 108 | 109 | The precise terms and conditions for copying, distribution and 110 | modification follow. Pay close attention to the difference between a 111 | "work based on the library" and a "work that uses the library". The 112 | former contains code derived from the library, whereas the latter must 113 | be combined with the library in order to run. 114 | 115 | GNU LESSER GENERAL PUBLIC LICENSE 116 | TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 117 | 118 | 0. This License Agreement applies to any software library or other 119 | program which contains a notice placed by the copyright holder or 120 | other authorized party saying it may be distributed under the terms of 121 | this Lesser General Public License (also called "this License"). 122 | Each licensee is addressed as "you". 123 | 124 | A "library" means a collection of software functions and/or data 125 | prepared so as to be conveniently linked with application programs 126 | (which use some of those functions and data) to form executables. 127 | 128 | The "Library", below, refers to any such software library or work 129 | which has been distributed under these terms. A "work based on the 130 | Library" means either the Library or any derivative work under 131 | copyright law: that is to say, a work containing the Library or a 132 | portion of it, either verbatim or with modifications and/or translated 133 | straightforwardly into another language. (Hereinafter, translation is 134 | included without limitation in the term "modification".) 135 | 136 | "Source code" for a work means the preferred form of the work for 137 | making modifications to it. For a library, complete source code means 138 | all the source code for all modules it contains, plus any associated 139 | interface definition files, plus the scripts used to control compilation 140 | and installation of the library. 141 | 142 | Activities other than copying, distribution and modification are not 143 | covered by this License; they are outside its scope. The act of 144 | running a program using the Library is not restricted, and output from 145 | such a program is covered only if its contents constitute a work based 146 | on the Library (independent of the use of the Library in a tool for 147 | writing it). Whether that is true depends on what the Library does 148 | and what the program that uses the Library does. 149 | 150 | 1. You may copy and distribute verbatim copies of the Library's 151 | complete source code as you receive it, in any medium, provided that 152 | you conspicuously and appropriately publish on each copy an 153 | appropriate copyright notice and disclaimer of warranty; keep intact 154 | all the notices that refer to this License and to the absence of any 155 | warranty; and distribute a copy of this License along with the 156 | Library. 157 | 158 | You may charge a fee for the physical act of transferring a copy, 159 | and you may at your option offer warranty protection in exchange for a 160 | fee. 161 | 162 | 2. You may modify your copy or copies of the Library or any portion 163 | of it, thus forming a work based on the Library, and copy and 164 | distribute such modifications or work under the terms of Section 1 165 | above, provided that you also meet all of these conditions: 166 | 167 | a) The modified work must itself be a software library. 168 | 169 | b) You must cause the files modified to carry prominent notices 170 | stating that you changed the files and the date of any change. 171 | 172 | c) You must cause the whole of the work to be licensed at no 173 | charge to all third parties under the terms of this License. 174 | 175 | d) If a facility in the modified Library refers to a function or a 176 | table of data to be supplied by an application program that uses 177 | the facility, other than as an argument passed when the facility 178 | is invoked, then you must make a good faith effort to ensure that, 179 | in the event an application does not supply such function or 180 | table, the facility still operates, and performs whatever part of 181 | its purpose remains meaningful. 182 | 183 | (For example, a function in a library to compute square roots has 184 | a purpose that is entirely well-defined independent of the 185 | application. Therefore, Subsection 2d requires that any 186 | application-supplied function or table used by this function must 187 | be optional: if the application does not supply it, the square 188 | root function must still compute square roots.) 189 | 190 | These requirements apply to the modified work as a whole. If 191 | identifiable sections of that work are not derived from the Library, 192 | and can be reasonably considered independent and separate works in 193 | themselves, then this License, and its terms, do not apply to those 194 | sections when you distribute them as separate works. But when you 195 | distribute the same sections as part of a whole which is a work based 196 | on the Library, the distribution of the whole must be on the terms of 197 | this License, whose permissions for other licensees extend to the 198 | entire whole, and thus to each and every part regardless of who wrote 199 | it. 200 | 201 | Thus, it is not the intent of this section to claim rights or contest 202 | your rights to work written entirely by you; rather, the intent is to 203 | exercise the right to control the distribution of derivative or 204 | collective works based on the Library. 205 | 206 | In addition, mere aggregation of another work not based on the Library 207 | with the Library (or with a work based on the Library) on a volume of 208 | a storage or distribution medium does not bring the other work under 209 | the scope of this License. 210 | 211 | 3. You may opt to apply the terms of the ordinary GNU General Public 212 | License instead of this License to a given copy of the Library. To do 213 | this, you must alter all the notices that refer to this License, so 214 | that they refer to the ordinary GNU General Public License, version 2, 215 | instead of to this License. (If a newer version than version 2 of the 216 | ordinary GNU General Public License has appeared, then you can specify 217 | that version instead if you wish.) Do not make any other change in 218 | these notices. 219 | 220 | Once this change is made in a given copy, it is irreversible for 221 | that copy, so the ordinary GNU General Public License applies to all 222 | subsequent copies and derivative works made from that copy. 223 | 224 | This option is useful when you wish to copy part of the code of 225 | the Library into a program that is not a library. 226 | 227 | 4. You may copy and distribute the Library (or a portion or 228 | derivative of it, under Section 2) in object code or executable form 229 | under the terms of Sections 1 and 2 above provided that you accompany 230 | it with the complete corresponding machine-readable source code, which 231 | must be distributed under the terms of Sections 1 and 2 above on a 232 | medium customarily used for software interchange. 233 | 234 | If distribution of object code is made by offering access to copy 235 | from a designated place, then offering equivalent access to copy the 236 | source code from the same place satisfies the requirement to 237 | distribute the source code, even though third parties are not 238 | compelled to copy the source along with the object code. 239 | 240 | 5. A program that contains no derivative of any portion of the 241 | Library, but is designed to work with the Library by being compiled or 242 | linked with it, is called a "work that uses the Library". Such a 243 | work, in isolation, is not a derivative work of the Library, and 244 | therefore falls outside the scope of this License. 245 | 246 | However, linking a "work that uses the Library" with the Library 247 | creates an executable that is a derivative of the Library (because it 248 | contains portions of the Library), rather than a "work that uses the 249 | library". The executable is therefore covered by this License. 250 | Section 6 states terms for distribution of such executables. 251 | 252 | When a "work that uses the Library" uses material from a header file 253 | that is part of the Library, the object code for the work may be a 254 | derivative work of the Library even though the source code is not. 255 | Whether this is true is especially significant if the work can be 256 | linked without the Library, or if the work is itself a library. The 257 | threshold for this to be true is not precisely defined by law. 258 | 259 | If such an object file uses only numerical parameters, data 260 | structure layouts and accessors, and small macros and small inline 261 | functions (ten lines or less in length), then the use of the object 262 | file is unrestricted, regardless of whether it is legally a derivative 263 | work. (Executables containing this object code plus portions of the 264 | Library will still fall under Section 6.) 265 | 266 | Otherwise, if the work is a derivative of the Library, you may 267 | distribute the object code for the work under the terms of Section 6. 268 | Any executables containing that work also fall under Section 6, 269 | whether or not they are linked directly with the Library itself. 270 | 271 | 6. As an exception to the Sections above, you may also combine or 272 | link a "work that uses the Library" with the Library to produce a 273 | work containing portions of the Library, and distribute that work 274 | under terms of your choice, provided that the terms permit 275 | modification of the work for the customer's own use and reverse 276 | engineering for debugging such modifications. 277 | 278 | You must give prominent notice with each copy of the work that the 279 | Library is used in it and that the Library and its use are covered by 280 | this License. You must supply a copy of this License. If the work 281 | during execution displays copyright notices, you must include the 282 | copyright notice for the Library among them, as well as a reference 283 | directing the user to the copy of this License. Also, you must do one 284 | of these things: 285 | 286 | a) Accompany the work with the complete corresponding 287 | machine-readable source code for the Library including whatever 288 | changes were used in the work (which must be distributed under 289 | Sections 1 and 2 above); and, if the work is an executable linked 290 | with the Library, with the complete machine-readable "work that 291 | uses the Library", as object code and/or source code, so that the 292 | user can modify the Library and then relink to produce a modified 293 | executable containing the modified Library. (It is understood 294 | that the user who changes the contents of definitions files in the 295 | Library will not necessarily be able to recompile the application 296 | to use the modified definitions.) 297 | 298 | b) Use a suitable shared library mechanism for linking with the 299 | Library. A suitable mechanism is one that (1) uses at run time a 300 | copy of the library already present on the user's computer system, 301 | rather than copying library functions into the executable, and (2) 302 | will operate properly with a modified version of the library, if 303 | the user installs one, as long as the modified version is 304 | interface-compatible with the version that the work was made with. 305 | 306 | c) Accompany the work with a written offer, valid for at 307 | least three years, to give the same user the materials 308 | specified in Subsection 6a, above, for a charge no more 309 | than the cost of performing this distribution. 310 | 311 | d) If distribution of the work is made by offering access to copy 312 | from a designated place, offer equivalent access to copy the above 313 | specified materials from the same place. 314 | 315 | e) Verify that the user has already received a copy of these 316 | materials or that you have already sent this user a copy. 317 | 318 | For an executable, the required form of the "work that uses the 319 | Library" must include any data and utility programs needed for 320 | reproducing the executable from it. However, as a special exception, 321 | the materials to be distributed need not include anything that is 322 | normally distributed (in either source or binary form) with the major 323 | components (compiler, kernel, and so on) of the operating system on 324 | which the executable runs, unless that component itself accompanies 325 | the executable. 326 | 327 | It may happen that this requirement contradicts the license 328 | restrictions of other proprietary libraries that do not normally 329 | accompany the operating system. Such a contradiction means you cannot 330 | use both them and the Library together in an executable that you 331 | distribute. 332 | 333 | 7. You may place library facilities that are a work based on the 334 | Library side-by-side in a single library together with other library 335 | facilities not covered by this License, and distribute such a combined 336 | library, provided that the separate distribution of the work based on 337 | the Library and of the other library facilities is otherwise 338 | permitted, and provided that you do these two things: 339 | 340 | a) Accompany the combined library with a copy of the same work 341 | based on the Library, uncombined with any other library 342 | facilities. This must be distributed under the terms of the 343 | Sections above. 344 | 345 | b) Give prominent notice with the combined library of the fact 346 | that part of it is a work based on the Library, and explaining 347 | where to find the accompanying uncombined form of the same work. 348 | 349 | 8. You may not copy, modify, sublicense, link with, or distribute 350 | the Library except as expressly provided under this License. Any 351 | attempt otherwise to copy, modify, sublicense, link with, or 352 | distribute the Library is void, and will automatically terminate your 353 | rights under this License. However, parties who have received copies, 354 | or rights, from you under this License will not have their licenses 355 | terminated so long as such parties remain in full compliance. 356 | 357 | 9. You are not required to accept this License, since you have not 358 | signed it. However, nothing else grants you permission to modify or 359 | distribute the Library or its derivative works. These actions are 360 | prohibited by law if you do not accept this License. Therefore, by 361 | modifying or distributing the Library (or any work based on the 362 | Library), you indicate your acceptance of this License to do so, and 363 | all its terms and conditions for copying, distributing or modifying 364 | the Library or works based on it. 365 | 366 | 10. Each time you redistribute the Library (or any work based on the 367 | Library), the recipient automatically receives a license from the 368 | original licensor to copy, distribute, link with or modify the Library 369 | subject to these terms and conditions. You may not impose any further 370 | restrictions on the recipients' exercise of the rights granted herein. 371 | You are not responsible for enforcing compliance by third parties with 372 | this License. 373 | 374 | 11. If, as a consequence of a court judgment or allegation of patent 375 | infringement or for any other reason (not limited to patent issues), 376 | conditions are imposed on you (whether by court order, agreement or 377 | otherwise) that contradict the conditions of this License, they do not 378 | excuse you from the conditions of this License. If you cannot 379 | distribute so as to satisfy simultaneously your obligations under this 380 | License and any other pertinent obligations, then as a consequence you 381 | may not distribute the Library at all. For example, if a patent 382 | license would not permit royalty-free redistribution of the Library by 383 | all those who receive copies directly or indirectly through you, then 384 | the only way you could satisfy both it and this License would be to 385 | refrain entirely from distribution of the Library. 386 | 387 | If any portion of this section is held invalid or unenforceable under any 388 | particular circumstance, the balance of the section is intended to apply, 389 | and the section as a whole is intended to apply in other circumstances. 390 | 391 | It is not the purpose of this section to induce you to infringe any 392 | patents or other property right claims or to contest validity of any 393 | such claims; this section has the sole purpose of protecting the 394 | integrity of the free software distribution system which is 395 | implemented by public license practices. Many people have made 396 | generous contributions to the wide range of software distributed 397 | through that system in reliance on consistent application of that 398 | system; it is up to the author/donor to decide if he or she is willing 399 | to distribute software through any other system and a licensee cannot 400 | impose that choice. 401 | 402 | This section is intended to make thoroughly clear what is believed to 403 | be a consequence of the rest of this License. 404 | 405 | 12. If the distribution and/or use of the Library is restricted in 406 | certain countries either by patents or by copyrighted interfaces, the 407 | original copyright holder who places the Library under this License may add 408 | an explicit geographical distribution limitation excluding those countries, 409 | so that distribution is permitted only in or among countries not thus 410 | excluded. In such case, this License incorporates the limitation as if 411 | written in the body of this License. 412 | 413 | 13. The Free Software Foundation may publish revised and/or new 414 | versions of the Lesser General Public License from time to time. 415 | Such new versions will be similar in spirit to the present version, 416 | but may differ in detail to address new problems or concerns. 417 | 418 | Each version is given a distinguishing version number. If the Library 419 | specifies a version number of this License which applies to it and 420 | "any later version", you have the option of following the terms and 421 | conditions either of that version or of any later version published by 422 | the Free Software Foundation. If the Library does not specify a 423 | license version number, you may choose any version ever published by 424 | the Free Software Foundation. 425 | 426 | 14. If you wish to incorporate parts of the Library into other free 427 | programs whose distribution conditions are incompatible with these, 428 | write to the author to ask for permission. For software which is 429 | copyrighted by the Free Software Foundation, write to the Free 430 | Software Foundation; we sometimes make exceptions for this. Our 431 | decision will be guided by the two goals of preserving the free status 432 | of all derivatives of our free software and of promoting the sharing 433 | and reuse of software generally. 434 | 435 | NO WARRANTY 436 | 437 | 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO 438 | WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. 439 | EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR 440 | OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY 441 | KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE 442 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 443 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE 444 | LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME 445 | THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 446 | 447 | 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN 448 | WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY 449 | AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU 450 | FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR 451 | CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE 452 | LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING 453 | RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A 454 | FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF 455 | SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH 456 | DAMAGES. 457 | 458 | END OF TERMS AND CONDITIONS 459 | 460 | How to Apply These Terms to Your New Libraries 461 | 462 | If you develop a new library, and you want it to be of the greatest 463 | possible use to the public, we recommend making it free software that 464 | everyone can redistribute and change. You can do so by permitting 465 | redistribution under these terms (or, alternatively, under the terms of the 466 | ordinary General Public License). 467 | 468 | To apply these terms, attach the following notices to the library. It is 469 | safest to attach them to the start of each source file to most effectively 470 | convey the exclusion of warranty; and each file should have at least the 471 | "copyright" line and a pointer to where the full notice is found. 472 | 473 | 474 | Copyright (C) 475 | 476 | This library is free software; you can redistribute it and/or 477 | modify it under the terms of the GNU Lesser General Public 478 | License as published by the Free Software Foundation; either 479 | version 2.1 of the License, or (at your option) any later version. 480 | 481 | This library is distributed in the hope that it will be useful, 482 | but WITHOUT ANY WARRANTY; without even the implied warranty of 483 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 484 | Lesser General Public License for more details. 485 | 486 | You should have received a copy of the GNU Lesser General Public 487 | License along with this library; if not, write to the Free Software 488 | Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 489 | 490 | Also add information on how to contact you by electronic and paper mail. 491 | 492 | You should also get your employer (if you work as a programmer) or your 493 | school, if any, to sign a "copyright disclaimer" for the library, if 494 | necessary. Here is a sample; alter the names: 495 | 496 | Yoyodyne, Inc., hereby disclaims all copyright interest in the 497 | library `Frob' (a library for tweaking knobs) written by James Random Hacker. 498 | 499 | , 1 April 1990 500 | Ty Coon, President of Vice 501 | 502 | That's all there is to it! 503 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | #### sha256_plsql 2 | SHA256 PL/SQL Implementation for Oracle 10g,11g. 3 |

4 | #### Installation 5 | Compile package in sqlplus
6 | 7 | ``` 8 | SQL> @sha256_pkg 9 | Package created. 10 | SQL> @sha256_body 11 | Package body created. 12 | ``` 13 | #### Usage 14 | ``` 15 | SQL> select sha256.encrypt('test message') from dual; 16 | 3f0a377ba0a4a460ecb616f6507ce0d8cfa3e704025d4fda3ed0c5ca05468728 17 | 18 | SQL> select sha256.encrypt_raw('74657374206D657373616765') from dual; 19 | 3f0a377ba0a4a460ecb616f6507ce0d8cfa3e704025d4fda3ed0c5ca05468728 20 | ``` 21 | -------------------------------------------------------------------------------- /sha256_pkg.sql: -------------------------------------------------------------------------------- 1 | CREATE OR REPLACE PACKAGE SHA256 IS 2 | /* 3 | Oracle PL/SQL Package to compute SHA256 message digest of files or memory blocks. 4 | according to the definition of SHA256 in FIPS 180-2. 5 | 6 | Copyright (C) 2014, Steve Jang 7 | 8 | This library is free software; you can redistribute it and/or 9 | modify it under the terms of the GNU Lesser General Public 10 | License as published by the Free Software Foundation; either 11 | version 2.1 of the License, or (at your option) any later version. 12 | 13 | This library is distributed in the hope that it will be useful, 14 | but WITHOUT ANY WARRANTY; without even the implied warranty of 15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 16 | Lesser General Public License for more details. 17 | 18 | You should have received a copy of the GNU Lesser General Public 19 | License along with this library; if not, write to the Free Software 20 | Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 21 | */ 22 | 23 | -- type declarations 24 | TYPE ta_number IS TABLE OF NUMBER INDEX BY binary_integer; 25 | 26 | TYPE tr_ctx IS RECORD ( 27 | H TA_NUMBER, --//8 28 | total TA_NUMBER, --//2 29 | buflen NUMBER, 30 | buffer32 TA_NUMBER --//32 31 | ); 32 | 33 | -- constant declarations 34 | /* Constant for 32bit bitwise operations */ 35 | fullbits NUMBER := to_number('FFFFFFFF','xxxxxxxx'); 36 | bits_FF000000 NUMBER := to_number('FF000000','xxxxxxxx'); 37 | bits_00FF0000 NUMBER := to_number('00FF0000','xxxxxxxx'); 38 | bits_0000FF00 NUMBER := to_number('0000FF00','xxxxxxxx'); 39 | bits_000000FF NUMBER := to_number('000000FF','xxxxxxxx'); 40 | bits_00FFFFFF NUMBER := to_number('00FFFFFF','xxxxxxxx'); 41 | bits_FF00FFFF NUMBER := to_number('FF00FFFF','xxxxxxxx'); 42 | bits_FFFF00FF NUMBER := to_number('FFFF00FF','xxxxxxxx'); 43 | bits_FFFFFF00 NUMBER := to_number('FFFFFF00','xxxxxxxx'); 44 | bits_FFFF0000 NUMBER := to_number('FFFF0000','xxxxxxxx'); 45 | bits_80000000 NUMBER := to_number('80000000','xxxxxxxx'); 46 | bits_00800000 NUMBER := to_number('00800000','xxxxxxxx'); 47 | bits_00008000 NUMBER := to_number('00008000','xxxxxxxx'); 48 | bits_00000080 NUMBER := to_number('00000080','xxxxxxxx'); 49 | bits_FFFFFFC0 NUMBER := to_number('FFFFFFC0','xxxxxxxx'); 50 | 51 | /* This array contains the bytes used to pad the buffer to the next 52 | 64-byte boundary. (FIPS 180-2:5.1.1) */ 53 | fillbuf TA_NUMBER; --//16 { 0x80, 0 /* , 0, 0, ... */ }; 54 | 55 | /* Constants for SHA256 from FIPS 180-2:4.2.2. */ 56 | K TA_NUMBER; --//64 {...} 57 | 58 | 59 | 60 | -- Public function and procedure declarations 61 | 62 | /* Initialize structure containing state of computation. 63 | (FIPS 180-2: 5.3.2) */ 64 | PROCEDURE sha256_init_ctx (ctx IN OUT NOCOPY TR_CTX); 65 | 66 | /* Starting with the result of former calls of this function (or the 67 | initialization function update the context for the next LEN bytes 68 | starting at BUFFER. 69 | It is NOT required that LEN is a multiple of 64. */ 70 | PROCEDURE sha256_process_bytes (buffer IN RAW, 71 | len IN NUMBER, 72 | ctx IN OUT NOCOPY TR_CTX); 73 | 74 | 75 | /* Process LEN bytes of BUFFER, accumulating context into CTX. 76 | It is assumed that LEN % 64 == 0. */ 77 | PROCEDURE sha256_process_block (buffer IN TA_NUMBER, 78 | len IN NUMBER, 79 | ctx IN OUT NOCOPY TR_CTX); 80 | 81 | 82 | /* Process the remaining bytes in the buffer and put result from CTX 83 | in first 32 bytes following RESBUF. 84 | 85 | IMPORTANT: On some systems it is required that RESBUF is correctly 86 | aligned for a 32 bits value. */ 87 | PROCEDURE sha256_finish_ctx (ctx IN OUT NOCOPY TR_CTX, 88 | resbuf OUT NOCOPY TA_NUMBER); 89 | 90 | FUNCTION BITOR (x IN NUMBER, y IN NUMBER) RETURN NUMBER; 91 | FUNCTION BITXOR (x IN NUMBER, y IN NUMBER) RETURN NUMBER; 92 | FUNCTION BITNOT (x IN NUMBER) RETURN NUMBER; 93 | 94 | FUNCTION LEFTSHIFT( x IN NUMBER, y IN NUMBER) RETURN NUMBER; 95 | FUNCTION RIGHTSHIFT( x IN NUMBER, y IN NUMBER) RETURN NUMBER; 96 | FUNCTION CYCLIC( x IN NUMBER, y IN NUMBER) RETURN NUMBER; 97 | 98 | /* Operators defined in FIPS 180-2:4.1.2. */ 99 | FUNCTION OP_Ch(x IN NUMBER, y IN NUMBER, z IN NUMBER) RETURN NUMBER; 100 | FUNCTION OP_Maj(x IN NUMBER, y IN NUMBER, z IN NUMBER) RETURN NUMBER; 101 | FUNCTION OP_S0(x IN NUMBER) RETURN NUMBER; 102 | FUNCTION OP_S1(x IN NUMBER) RETURN NUMBER; 103 | FUNCTION OP_R0(x IN NUMBER) RETURN NUMBER; 104 | FUNCTION OP_R1(x IN NUMBER) RETURN NUMBER; 105 | 106 | /* Final Function */ 107 | FUNCTION ENCRYPT(x IN VARCHAR2) RETURN VARCHAR2; 108 | FUNCTION ENCRYPT_RAW(x IN RAW) RETURN VARCHAR2; 109 | 110 | END SHA256; 111 | / 112 | -------------------------------------------------------------------------------- /sha256_pkgbody.sql: -------------------------------------------------------------------------------- 1 | CREATE OR REPLACE PACKAGE BODY SHA256 IS 2 | /* 3 | Oracle PL/SQL Package to compute SHA256 message digest of files or memory blocks. 4 | according to the definition of SHA256 in FIPS 180-2. 5 | 6 | Copyright (C) 2014, Steve Jang 7 | 8 | This library is free software; you can redistribute it and/or 9 | modify it under the terms of the GNU Lesser General Public 10 | License as published by the Free Software Foundation; either 11 | version 2.1 of the License, or (at your option) any later version. 12 | 13 | This library is distributed in the hope that it will be useful, 14 | but WITHOUT ANY WARRANTY; without even the implied warranty of 15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 16 | Lesser General Public License for more details. 17 | 18 | You should have received a copy of the GNU Lesser General Public 19 | License along with this library; if not, write to the Free Software 20 | Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 21 | */ 22 | 23 | FUNCTION BITOR (x IN NUMBER, y IN NUMBER) RETURN NUMBER AS 24 | BEGIN 25 | RETURN (x + y - BITAND(x, y)); 26 | END; 27 | 28 | FUNCTION BITXOR (x IN NUMBER, y IN NUMBER) RETURN NUMBER AS 29 | BEGIN 30 | RETURN (BITOR(x, y) - BITAND(x, y)); 31 | END; 32 | FUNCTION BITNOT (x IN NUMBER) RETURN NUMBER AS 33 | BEGIN 34 | RETURN (fullbits - x); 35 | END; 36 | 37 | FUNCTION LEFTSHIFT( x IN NUMBER, y IN NUMBER) RETURN NUMBER AS 38 | tmp NUMBER := x; 39 | BEGIN 40 | FOR idx IN 1..y LOOP 41 | tmp := tmp * 2; 42 | END LOOP; 43 | RETURN BITAND(tmp, fullbits); 44 | END; 45 | FUNCTION RIGHTSHIFT( x IN NUMBER, y IN NUMBER) RETURN NUMBER AS 46 | tmp NUMBER := x; 47 | BEGIN 48 | FOR idx IN 1..y LOOP 49 | tmp := trunc(tmp / 2); 50 | END LOOP; 51 | RETURN BITAND(tmp, fullbits); 52 | END; 53 | FUNCTION CYCLIC( x IN NUMBER, y IN NUMBER) RETURN NUMBER AS 54 | BEGIN 55 | RETURN BITOR( 56 | RIGHTSHIFT(x, y), 57 | LEFTSHIFT(x, 32-y) 58 | ); 59 | END; 60 | 61 | /* Operators defined in FIPS 180-2:4.1.2. */ 62 | FUNCTION OP_Ch(x IN NUMBER, y IN NUMBER, z IN NUMBER) RETURN NUMBER AS 63 | BEGIN 64 | RETURN BITXOR( 65 | BITAND(x, y), 66 | BITAND(BITNOT(x), z) 67 | ); 68 | END; 69 | 70 | FUNCTION OP_Maj(x IN NUMBER, y IN NUMBER, z IN NUMBER) RETURN NUMBER AS 71 | BEGIN 72 | RETURN BITXOR( 73 | BITXOR( 74 | BITAND(x,y), 75 | BITAND(x,z) 76 | ), 77 | BITAND(y,z) 78 | ); 79 | END; 80 | 81 | FUNCTION OP_S0(x IN NUMBER) RETURN NUMBER AS 82 | BEGIN 83 | RETURN BITXOR( 84 | BITXOR( 85 | CYCLIC(x,2), 86 | CYCLIC(x,13) 87 | ), 88 | CYCLIC(x,22) 89 | ); 90 | END; 91 | 92 | FUNCTION OP_S1(x IN NUMBER) RETURN NUMBER AS 93 | BEGIN 94 | RETURN BITXOR( 95 | BITXOR( 96 | CYCLIC(x, 6), 97 | CYCLIC(x, 11) 98 | ), 99 | CYCLIC(x, 25) 100 | ); 101 | END; 102 | 103 | FUNCTION OP_R0(x IN NUMBER) RETURN NUMBER AS 104 | BEGIN 105 | RETURN BITXOR( 106 | BITXOR( 107 | CYCLIC(x, 7), 108 | CYCLIC(x, 18) 109 | ), 110 | RIGHTSHIFT(x, 3) 111 | ); 112 | END; 113 | 114 | FUNCTION OP_R1(x IN NUMBER) RETURN NUMBER AS 115 | BEGIN 116 | RETURN BITXOR( 117 | BITXOR( 118 | CYCLIC(x, 17), 119 | CYCLIC(x, 19) 120 | ), 121 | RIGHTSHIFT(x, 10) 122 | ); 123 | END; 124 | 125 | 126 | /* Initialize structure containing state of computation. 127 | (FIPS 180-2: 5.3.2) */ 128 | PROCEDURE sha256_init_ctx (ctx IN OUT NOCOPY TR_CTX) 129 | IS 130 | BEGIN 131 | ctx.H(0) := to_number('6a09e667', 'xxxxxxxx'); 132 | ctx.H(1) := to_number('bb67ae85', 'xxxxxxxx'); 133 | ctx.H(2) := to_number('3c6ef372', 'xxxxxxxx'); 134 | ctx.H(3) := to_number('a54ff53a', 'xxxxxxxx'); 135 | ctx.H(4) := to_number('510e527f', 'xxxxxxxx'); 136 | ctx.H(5) := to_number('9b05688c', 'xxxxxxxx'); 137 | ctx.H(6) := to_number('1f83d9ab', 'xxxxxxxx'); 138 | ctx.H(7) := to_number('5be0cd19', 'xxxxxxxx'); 139 | ctx.total(0) := 0; 140 | ctx.total(1) := 0; 141 | ctx.buflen := 0; 142 | FOR idx IN 0..32 LOOP 143 | ctx.buffer32(idx) := 0; 144 | END LOOP; 145 | 146 | END; 147 | 148 | /* Process LEN bytes of BUFFER, accumulating context into CTX. 149 | It is assumed that LEN % 64 == 0. */ 150 | procedure sha256_process_block (buffer IN TA_NUMBER, 151 | len IN NUMBER, 152 | ctx IN OUT NOCOPY TR_CTX) 153 | IS 154 | words TA_NUMBER := buffer; 155 | nwords NUMBER := trunc(len / 4); 156 | pos_words NUMBER; 157 | 158 | t NUMBER; 159 | a NUMBER := ctx.H(0); 160 | b NUMBER := ctx.H(1); 161 | c NUMBER := ctx.H(2); 162 | d NUMBER := ctx.H(3); 163 | e NUMBER := ctx.H(4); 164 | f NUMBER := ctx.H(5); 165 | g NUMBER := ctx.H(6); 166 | h NUMBER := ctx.H(7); 167 | 168 | W TA_NUMBER; --//[64] ; 169 | a_save NUMBER; 170 | b_save NUMBER; 171 | c_save NUMBER; 172 | d_save NUMBER; 173 | e_save NUMBER; 174 | f_save NUMBER; 175 | g_save NUMBER; 176 | h_save NUMBER; 177 | 178 | T1 NUMBER; 179 | T2 NUMBER; 180 | 181 | BEGIN 182 | 183 | /* First increment the byte count. FIPS 180-2 specifies the possible 184 | length of the file up to 2^64 bits. Here we only compute the 185 | number of bytes. */ 186 | ctx.total(1) := ctx.total(1) + len; 187 | 188 | /* Process all bytes in the buffer with 64 bytes in each round of 189 | the loop. */ 190 | pos_words := 0; 191 | WHILE (nwords > 0) 192 | LOOP 193 | a_save := a; 194 | b_save := b; 195 | c_save := c; 196 | d_save := d; 197 | e_save := e; 198 | f_save := f; 199 | g_save := g; 200 | h_save := h; 201 | 202 | /* Compute the message schedule according to FIPS 180-2:6.2.2 step 2. */ 203 | FOR t IN 0..15 LOOP 204 | W(t) := words(pos_words); 205 | pos_words := pos_words + 1; 206 | END LOOP; 207 | 208 | FOR t IN 16..63 LOOP 209 | W(t) := BITAND(OP_R1(W(t-2)) + W(t-7) + OP_R0(W(t-15)) + W(t-16), fullbits); 210 | END LOOP; 211 | 212 | /* The actual computation according to FIPS 180-2:6.2.2 step 3. */ 213 | FOR t IN 0..63 LOOP 214 | T1 := BITAND(h + OP_S1(e) + OP_Ch (e, f, g) + K(t) + W(t), fullbits); 215 | T2 := BITAND(OP_S0(a) + OP_Maj (a, b, c), fullbits); 216 | h := g; 217 | g := f; 218 | f := e; 219 | e := BITAND(d + T1, fullbits); 220 | d := c; 221 | c := b; 222 | b := a; 223 | a := BITAND(T1 + T2, fullbits); 224 | END LOOP; 225 | 226 | /* Add the starting values of the context according to FIPS 180-2:6.2.2 step 4. */ 227 | a := BITAND(a + a_save, fullbits); 228 | b := BITAND(b + b_save, fullbits); 229 | c := BITAND(c + c_save, fullbits); 230 | d := BITAND(d + d_save, fullbits); 231 | e := BITAND(e + e_save, fullbits); 232 | f := BITAND(f + f_save, fullbits); 233 | g := BITAND(g + g_save, fullbits); 234 | h := BITAND(h + h_save, fullbits); 235 | 236 | /* Prepare for the next round. */ 237 | nwords := nwords - 16; 238 | 239 | END LOOP; 240 | 241 | /* Put checksum in context given as argument. */ 242 | ctx.H(0) := a; 243 | ctx.H(1) := b; 244 | ctx.H(2) := c; 245 | ctx.H(3) := d; 246 | ctx.H(4) := e; 247 | ctx.H(5) := f; 248 | ctx.H(6) := g; 249 | ctx.H(7) := h; 250 | 251 | END; 252 | 253 | 254 | /* Starting with the result of former calls of this function (or the 255 | initialization function update the context for the next LEN bytes 256 | starting at BUFFER. 257 | It is NOT required that LEN is a multiple of 64. */ 258 | PROCEDURE sha256_process_bytes (buffer IN RAW, 259 | len IN NUMBER, 260 | ctx IN OUT NOCOPY TR_CTX) 261 | IS 262 | left_over NUMBER; 263 | left_over_blk NUMBER; 264 | left_over_mod NUMBER; 265 | add NUMBER; 266 | t_len NUMBER := len; 267 | t_buffer RAW(32767) := buffer; 268 | x_buffer32 TA_NUMBER; 269 | 270 | BEGIN 271 | /* When we already have some bits in our internal buffer concatenate 272 | both inputs first. */ 273 | IF (ctx.buflen > 0) THEN 274 | 275 | left_over := ctx.buflen; 276 | add := CASE WHEN 128 - left_over > t_len THEN t_len ELSE 128 - left_over END; 277 | 278 | FOR idx IN 1..add LOOP 279 | left_over_blk := trunc((left_over+idx-1)/4); 280 | left_over_mod := mod((left_over+idx-1), 4); 281 | 282 | IF (left_over_mod=0) THEN 283 | ctx.buffer32(left_over_blk) := BITAND(ctx.buffer32(left_over_blk),bits_00FFFFFF) + to_number(utl_raw.substr(t_buffer,idx,1),'0x')*16777216; 284 | ELSIF (left_over_mod=1) THEN 285 | ctx.buffer32(left_over_blk) := BITAND(ctx.buffer32(left_over_blk),bits_FF00FFFF) + to_number(utl_raw.substr(t_buffer,idx,1),'0x')*65536; 286 | ELSIF (left_over_mod=2) THEN 287 | ctx.buffer32(left_over_blk) := BITAND(ctx.buffer32(left_over_blk),bits_FFFF00FF) + to_number(utl_raw.substr(t_buffer,idx,1),'0x')*256; 288 | ELSE 289 | ctx.buffer32(left_over_blk) := BITAND(ctx.buffer32(left_over_blk),bits_FFFFFF00) + to_number(utl_raw.substr(t_buffer,idx,1),'0x'); 290 | END IF; 291 | END LOOP; 292 | 293 | ctx.buflen := ctx.buflen + add; 294 | 295 | IF (ctx.buflen > 64) THEN 296 | sha256_process_block (ctx.buffer32, BITAND(ctx.buflen, bits_FFFFFFC0), ctx); 297 | 298 | ctx.buflen := BITAND(ctx.buflen, 63); 299 | 300 | /* The regions in the following copy operation cannot overlap. */ 301 | /* memcpy (ctx->buffer, ctx->buffer[(left_over + add) bitand ~63], ctx->buflen); */ 302 | FOR idx IN 1..ctx.buflen LOOP 303 | DECLARE 304 | dest_pos NUMBER := idx-1; 305 | dest_pos_blk NUMBER := trunc(dest_pos/4); 306 | dest_pos_mod NUMBER := mod(dest_pos, 4); 307 | src_pos NUMBER := BITAND(left_over + add, bits_FFFFFFC0)+idx-1; 308 | src_pos_blk NUMBER := trunc(src_pos/4); 309 | src_pos_mod NUMBER := mod(src_pos, 4); 310 | byte_value NUMBER; 311 | BEGIN 312 | 313 | IF (src_pos_mod=0) THEN 314 | byte_value := BITAND(ctx.buffer32(src_pos_blk),bits_FF000000)/16777216; 315 | ELSIF (src_pos_mod=1) THEN 316 | byte_value := BITAND(ctx.buffer32(src_pos_blk),bits_00FF0000)/65536; 317 | ELSIF (src_pos_mod=2) THEN 318 | byte_value := BITAND(ctx.buffer32(src_pos_blk),bits_0000FF00)/256; 319 | ELSE 320 | byte_value := BITAND(ctx.buffer32(src_pos_blk),bits_000000FF); 321 | END IF; 322 | 323 | IF (dest_pos_mod=0) THEN 324 | ctx.buffer32(dest_pos_blk) := BITAND(ctx.buffer32(dest_pos_blk),bits_00FFFFFF) + byte_value*16777216; 325 | ELSIF (dest_pos_mod=1) THEN 326 | ctx.buffer32(dest_pos_blk) := BITAND(ctx.buffer32(dest_pos_blk),bits_FF00FFFF) + byte_value*65536; 327 | ELSIF (dest_pos_mod=2) THEN 328 | ctx.buffer32(dest_pos_blk) := BITAND(ctx.buffer32(dest_pos_blk),bits_FFFF00FF) + byte_value*256; 329 | ELSE 330 | ctx.buffer32(dest_pos_blk) := BITAND(ctx.buffer32(dest_pos_blk),bits_FFFFFF00) + byte_value; 331 | END IF; 332 | END; 333 | 334 | END LOOP; 335 | END IF; 336 | 337 | t_buffer := utl_raw.substr(t_buffer, add+1); 338 | t_len := t_len - add; 339 | END IF; 340 | 341 | /* Process available complete blocks. */ 342 | IF (t_len >= 64) THEN 343 | 344 | DECLARE 345 | cnt NUMBER := BITAND(t_len, bits_FFFFFFC0); 346 | target_blk NUMBER; 347 | target_mod NUMBER; 348 | BEGIN 349 | FOR idx IN 0..cnt LOOP 350 | x_buffer32(idx) := 0; 351 | END LOOP; 352 | 353 | FOR idx IN 1..cnt LOOP 354 | target_blk := trunc((idx-1)/4); 355 | target_mod := mod((idx-1), 4); 356 | 357 | IF (target_mod=0) THEN 358 | x_buffer32(target_blk) := BITAND(x_buffer32(target_blk),bits_00FFFFFF) + to_number(utl_raw.substr(t_buffer,idx,1),'0x')*16777216; 359 | ELSIF (target_mod=1) THEN 360 | x_buffer32(target_blk) := BITAND(x_buffer32(target_blk),bits_FF00FFFF) + to_number(utl_raw.substr(t_buffer,idx,1),'0x')*65536; 361 | ELSIF (target_mod=2) THEN 362 | x_buffer32(target_blk) := BITAND(x_buffer32(target_blk),bits_FFFF00FF) + to_number(utl_raw.substr(t_buffer,idx,1),'0x')*256; 363 | ELSE 364 | x_buffer32(target_blk) := BITAND(x_buffer32(target_blk),bits_FFFFFF00) + to_number(utl_raw.substr(t_buffer,idx,1),'0x'); 365 | END IF; 366 | END LOOP; 367 | sha256_process_block (x_buffer32, cnt, ctx); 368 | IF (utl_raw.length(t_buffer) <= cnt) THEN 369 | t_buffer := ''; 370 | ELSE 371 | t_buffer := utl_raw.substr(t_buffer, cnt+1); 372 | END IF; 373 | END; 374 | 375 | t_len := BITAND(t_len, 63); 376 | END IF; 377 | 378 | 379 | 380 | /* Move remaining bytes into internal buffer. */ 381 | IF (t_len > 0) THEN 382 | 383 | left_over := ctx.buflen; 384 | 385 | /* memcpy (ctx->buffer[left_over], t_buffer, t_len); */ 386 | FOR idx IN 1..t_len LOOP 387 | left_over_blk := trunc((left_over+idx-1)/4); 388 | left_over_mod := mod((left_over+idx-1), 4); 389 | 390 | IF (left_over_mod=0) THEN 391 | ctx.buffer32(left_over_blk) := BITAND(ctx.buffer32(left_over_blk),bits_00FFFFFF) + to_number(utl_raw.substr(t_buffer,idx,1),'0x')*16777216; 392 | ELSIF (left_over_mod=1) THEN 393 | ctx.buffer32(left_over_blk) := BITAND(ctx.buffer32(left_over_blk),bits_FF00FFFF) + to_number(utl_raw.substr(t_buffer,idx,1),'0x')*65536; 394 | ELSIF (left_over_mod=2) THEN 395 | ctx.buffer32(left_over_blk) := BITAND(ctx.buffer32(left_over_blk),bits_FFFF00FF) + to_number(utl_raw.substr(t_buffer,idx,1),'0x')*256; 396 | ELSE 397 | ctx.buffer32(left_over_blk) := BITAND(ctx.buffer32(left_over_blk),bits_FFFFFF00) + to_number(utl_raw.substr(t_buffer,idx,1),'0x'); 398 | END IF; 399 | END LOOP; 400 | 401 | left_over := left_over + t_len; 402 | 403 | IF (left_over >= 64) THEN 404 | 405 | sha256_process_block (ctx.buffer32, 64, ctx); 406 | left_over := left_over - 64; 407 | 408 | /* memcpy (ctx->buffer, ctx->buffer[64], left_over); */ 409 | FOR idx IN 1..left_over LOOP 410 | DECLARE 411 | dest_pos NUMBER := idx-1; 412 | dest_pos_blk NUMBER := trunc(dest_pos/4); 413 | dest_pos_mod NUMBER := mod(dest_pos, 4); 414 | src_pos NUMBER := idx+64-1; 415 | src_pos_blk NUMBER := trunc(src_pos/4); 416 | src_pos_mod NUMBER := mod(src_pos, 4); 417 | byte_value NUMBER; 418 | BEGIN 419 | 420 | IF (src_pos_mod=0) THEN 421 | byte_value := BITAND(ctx.buffer32(src_pos_blk),bits_FF000000)/16777216; 422 | ELSIF (src_pos_mod=1) THEN 423 | byte_value := BITAND(ctx.buffer32(src_pos_blk),bits_00FF0000)/65536; 424 | ELSIF (src_pos_mod=2) THEN 425 | byte_value := BITAND(ctx.buffer32(src_pos_blk),bits_0000FF00)/256; 426 | ELSE 427 | byte_value := BITAND(ctx.buffer32(src_pos_blk),bits_000000FF); 428 | END IF; 429 | 430 | IF (dest_pos_mod=0) THEN 431 | ctx.buffer32(dest_pos_blk) := BITAND(ctx.buffer32(dest_pos_blk),bits_00FFFFFF) + byte_value*16777216; 432 | ELSIF (dest_pos_mod=1) THEN 433 | ctx.buffer32(dest_pos_blk) := BITAND(ctx.buffer32(dest_pos_blk),bits_FF00FFFF) + byte_value*65536; 434 | ELSIF (dest_pos_mod=2) THEN 435 | ctx.buffer32(dest_pos_blk) := BITAND(ctx.buffer32(dest_pos_blk),bits_FFFF00FF) + byte_value*256; 436 | ELSE 437 | ctx.buffer32(dest_pos_blk) := BITAND(ctx.buffer32(dest_pos_blk),bits_FFFFFF00) + byte_value; 438 | END IF; 439 | END; 440 | 441 | END LOOP; 442 | 443 | END IF; 444 | ctx.buflen := left_over; 445 | END IF; 446 | END; 447 | 448 | /* Process the remaining bytes in the buffer and put result from CTX 449 | in first 32 bytes following RESBUF. 450 | 451 | IMPORTANT: On some systems it is required that RESBUF is correctly 452 | aligned for a 32 bits value. */ 453 | PROCEDURE sha256_finish_ctx (ctx IN OUT NOCOPY TR_CTX, 454 | resbuf OUT NOCOPY TA_NUMBER) 455 | IS 456 | bytes NUMBER := ctx.buflen; 457 | pad NUMBER; 458 | pad_in NUMBER; 459 | pad_out NUMBER; 460 | start_idx NUMBER; 461 | i NUMBER; 462 | BEGIN 463 | /* Now count remaining bytes. */ 464 | ctx.total(1) := ctx.total(1)+bytes; 465 | 466 | /* Fill left bytes. */ 467 | IF (bytes >= 56) THEN 468 | pad := 64 + 56 - bytes; 469 | ELSE 470 | pad := 56 - bytes; 471 | END IF; 472 | pad_in := 4 - MOD(bytes,4); 473 | pad_out := pad - pad_in; 474 | start_idx := (bytes-MOD(bytes,4))/4; 475 | IF (pad_in < 4) THEN 476 | IF (pad_in = 1) THEN 477 | ctx.buffer32(start_idx) := BITAND(ctx.buffer32(start_idx), bits_FFFFFF00) + bits_00000080; 478 | ELSIF (pad_in = 2) THEN 479 | ctx.buffer32(start_idx) := BITAND(ctx.buffer32(start_idx), bits_FFFF0000) + bits_00008000; 480 | ELSIF (pad_in = 3) THEN 481 | ctx.buffer32(start_idx) := BITAND(ctx.buffer32(start_idx), bits_FF000000) + bits_00800000; 482 | END IF; 483 | 484 | FOR idx IN (start_idx+1)..(start_idx+1+pad_out/4-1) LOOP 485 | ctx.buffer32(idx) := 0; 486 | END LOOP; 487 | ELSE 488 | FOR idx IN start_idx..(start_idx+pad/4-1) LOOP 489 | IF (idx = start_idx) THEN 490 | ctx.buffer32(idx) := bits_80000000; 491 | ELSE 492 | ctx.buffer32(idx) := 0; 493 | END IF; 494 | END LOOP; 495 | END IF; 496 | 497 | 498 | /* Put the 64-bit file length in *bits* at the end of the buffer. */ 499 | ctx.buffer32((bytes + pad + 4) / 4) := BITAND(ctx.total(1) * 8, fullbits); 500 | ctx.buffer32((bytes + pad) / 4) := 501 | BITOR ( 502 | BITAND(ctx.total(0) * 8, fullbits), 503 | BITAND(ctx.total(1) / 536870912, fullbits) 504 | ); 505 | 506 | sha256_process_block (ctx.buffer32, bytes + pad + 8, ctx); 507 | 508 | FOR idx IN 0..7 LOOP 509 | resbuf(idx) := ctx.H(idx); 510 | END LOOP; 511 | END; 512 | 513 | FUNCTION ENCRYPT(x IN VARCHAR2) RETURN VARCHAR2 AS 514 | ctx TR_CTX; 515 | res TA_NUMBER; 516 | BEGIN 517 | RETURN ENCRYPT_RAW(utl_raw.cast_to_raw(x)); 518 | END; 519 | 520 | FUNCTION ENCRYPT_RAW(x IN RAW) RETURN VARCHAR2 AS 521 | ctx TR_CTX; 522 | res TA_NUMBER; 523 | BEGIN 524 | sha256_init_ctx (ctx); 525 | 526 | sha256_process_bytes(x, utl_raw.length(x), ctx); 527 | 528 | sha256_finish_ctx(ctx, res); 529 | 530 | RETURN 531 | to_char(res(0),'FM0xxxxxxx') || 532 | to_char(res(1),'FM0xxxxxxx') || 533 | to_char(res(2),'FM0xxxxxxx') || 534 | to_char(res(3),'FM0xxxxxxx') || 535 | to_char(res(4),'FM0xxxxxxx') || 536 | to_char(res(5),'FM0xxxxxxx') || 537 | to_char(res(6),'FM0xxxxxxx') || 538 | to_char(res(7),'FM0xxxxxxx'); 539 | END; 540 | 541 | BEGIN 542 | -- Fill Buffer Initialization 543 | fillbuf(0) := bits_80000000; 544 | for i in 1..7 loop 545 | fillbuf(i) := 0; 546 | end loop; 547 | 548 | -- K Value Initialization 549 | K(0) := to_number('428a2f98', 'xxxxxxxx'); 550 | K(1) := to_number('71374491', 'xxxxxxxx'); 551 | K(2) := to_number('b5c0fbcf', 'xxxxxxxx'); 552 | K(3) := to_number('e9b5dba5', 'xxxxxxxx'); 553 | K(4) := to_number('3956c25b', 'xxxxxxxx'); 554 | K(5) := to_number('59f111f1', 'xxxxxxxx'); 555 | K(6) := to_number('923f82a4', 'xxxxxxxx'); 556 | K(7) := to_number('ab1c5ed5', 'xxxxxxxx'); 557 | K(8) := to_number('d807aa98', 'xxxxxxxx'); 558 | K(9) := to_number('12835b01', 'xxxxxxxx'); 559 | K(10) := to_number('243185be', 'xxxxxxxx'); 560 | K(11) := to_number('550c7dc3', 'xxxxxxxx'); 561 | K(12) := to_number('72be5d74', 'xxxxxxxx'); 562 | K(13) := to_number('80deb1fe', 'xxxxxxxx'); 563 | K(14) := to_number('9bdc06a7', 'xxxxxxxx'); 564 | K(15) := to_number('c19bf174', 'xxxxxxxx'); 565 | K(16) := to_number('e49b69c1', 'xxxxxxxx'); 566 | K(17) := to_number('efbe4786', 'xxxxxxxx'); 567 | K(18) := to_number('0fc19dc6', 'xxxxxxxx'); 568 | K(19) := to_number('240ca1cc', 'xxxxxxxx'); 569 | K(20) := to_number('2de92c6f', 'xxxxxxxx'); 570 | K(21) := to_number('4a7484aa', 'xxxxxxxx'); 571 | K(22) := to_number('5cb0a9dc', 'xxxxxxxx'); 572 | K(23) := to_number('76f988da', 'xxxxxxxx'); 573 | K(24) := to_number('983e5152', 'xxxxxxxx'); 574 | K(25) := to_number('a831c66d', 'xxxxxxxx'); 575 | K(26) := to_number('b00327c8', 'xxxxxxxx'); 576 | K(27) := to_number('bf597fc7', 'xxxxxxxx'); 577 | K(28) := to_number('c6e00bf3', 'xxxxxxxx'); 578 | K(29) := to_number('d5a79147', 'xxxxxxxx'); 579 | K(30) := to_number('06ca6351', 'xxxxxxxx'); 580 | K(31) := to_number('14292967', 'xxxxxxxx'); 581 | K(32) := to_number('27b70a85', 'xxxxxxxx'); 582 | K(33) := to_number('2e1b2138', 'xxxxxxxx'); 583 | K(34) := to_number('4d2c6dfc', 'xxxxxxxx'); 584 | K(35) := to_number('53380d13', 'xxxxxxxx'); 585 | K(36) := to_number('650a7354', 'xxxxxxxx'); 586 | K(37) := to_number('766a0abb', 'xxxxxxxx'); 587 | K(38) := to_number('81c2c92e', 'xxxxxxxx'); 588 | K(39) := to_number('92722c85', 'xxxxxxxx'); 589 | K(40) := to_number('a2bfe8a1', 'xxxxxxxx'); 590 | K(41) := to_number('a81a664b', 'xxxxxxxx'); 591 | K(42) := to_number('c24b8b70', 'xxxxxxxx'); 592 | K(43) := to_number('c76c51a3', 'xxxxxxxx'); 593 | K(44) := to_number('d192e819', 'xxxxxxxx'); 594 | K(45) := to_number('d6990624', 'xxxxxxxx'); 595 | K(46) := to_number('f40e3585', 'xxxxxxxx'); 596 | K(47) := to_number('106aa070', 'xxxxxxxx'); 597 | K(48) := to_number('19a4c116', 'xxxxxxxx'); 598 | K(49) := to_number('1e376c08', 'xxxxxxxx'); 599 | K(50) := to_number('2748774c', 'xxxxxxxx'); 600 | K(51) := to_number('34b0bcb5', 'xxxxxxxx'); 601 | K(52) := to_number('391c0cb3', 'xxxxxxxx'); 602 | K(53) := to_number('4ed8aa4a', 'xxxxxxxx'); 603 | K(54) := to_number('5b9cca4f', 'xxxxxxxx'); 604 | K(55) := to_number('682e6ff3', 'xxxxxxxx'); 605 | K(56) := to_number('748f82ee', 'xxxxxxxx'); 606 | K(57) := to_number('78a5636f', 'xxxxxxxx'); 607 | K(58) := to_number('84c87814', 'xxxxxxxx'); 608 | K(59) := to_number('8cc70208', 'xxxxxxxx'); 609 | K(60) := to_number('90befffa', 'xxxxxxxx'); 610 | K(61) := to_number('a4506ceb', 'xxxxxxxx'); 611 | K(62) := to_number('bef9a3f7', 'xxxxxxxx'); 612 | K(63) := to_number('c67178f2', 'xxxxxxxx'); 613 | 614 | END SHA256; 615 | / 616 | --------------------------------------------------------------------------------