SHA-1: Difference between revisions
(→{{header|Perl 6}}: mark as broken) |
(→{{header|Perl 6}}: GLR) |
||
| Line 734: | Line 734: | ||
=={{header|Perl 6}}== |
=={{header|Perl 6}}== |
||
{{broken}} |
|||
A pure Perl 6 implementation that closely follows the description of SHA-1 in FIPS 180-1. Slow. |
A pure Perl 6 implementation that closely follows the description of SHA-1 in FIPS 180-1. Slow. |
||
| Line 741: | Line 740: | ||
sub infix:<⊕> { ($^x + $^y)mod2³² } |
sub infix:<⊕> { ($^x + $^y)mod2³² } |
||
sub S { ($^x +< $^n)mod2³² +| ($x +> (32-$n)) } |
sub S { ($^x +< $^n)mod2³² +| ($x +> (32-$n)) } |
||
my \f = -> \B,\C,\D { (B +& C) +| ((+^B)mod2³² +& D) }, |
my \f = -> \B,\C,\D { (B +& C) +| ((+^B)mod2³² +& D) }, |
||
-> \B,\C,\D { B +^ C +^ D }, |
-> \B,\C,\D { B +^ C +^ D }, |
||
-> \B,\C,\D { (B +& C) +| (B +& D) +| (C +& D) }, |
-> \B,\C,\D { (B +& C) +| (B +& D) +| (C +& D) }, |
||
-> \B,\C,\D { B +^ C +^ D }; |
-> \B,\C,\D { B +^ C +^ D }; |
||
my \K = 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xCA62C1D6; |
my \K = 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xCA62C1D6; |
||
sub sha1-pad(Blob $msg) |
sub sha1-pad(Blob $msg) |
||
{ |
{ |
||
my \bits = 8 * $msg.elems; |
my \bits = 8 * $msg.elems; |
||
my @padded = $msg.list, 0x80, 0x00 xx (-($msg.elems + 1 + 8) % 64); |
my @padded = flat $msg.list, 0x80, 0x00 xx (-($msg.elems + 1 + 8) % 64); |
||
@padded.map({ :256[$^a,$^b,$^c,$^d] }), (bits +> 32)mod2³², (bits)mod2³²; |
flat @padded.map({ :256[$^a,$^b,$^c,$^d] }), (bits +> 32)mod2³², (bits)mod2³²; |
||
} |
} |
||
sub sha1-block(@H is rw, @M is copy) |
sub sha1-block(@H is rw, @M is copy) |
||
{ |
{ |
||
@M.push: S(1, [+^] @M[$_ «-« <3 8 14 16>] ) for 16 .. 79; |
@M.push: S(1, [+^] @M[$_ «-« <3 8 14 16>] ) for 16 .. 79; |
||
my ($A,$B,$C,$D,$E) = @H; |
my ($A,$B,$C,$D,$E) = @H; |
||
for 0..79 -> \t { |
for 0..79 -> \t { |
||
($A, $B, $C, $D, $E) = |
($A, $B, $C, $D, $E) = |
||
S(5,$A) ⊕ f[t div 20]($B,$C,$D) ⊕ $E ⊕ @M[t] ⊕ K[t div 20], |
S(5,$A) ⊕ f[t div 20]($B,$C,$D) ⊕ $E ⊕ @M[t] ⊕ K[t div 20], |
||
$A, S(30,$B), $C, $D; |
$A, S(30,$B), $C, $D; |
||
| Line 768: | Line 767: | ||
@H »⊕=« ($A,$B,$C,$D,$E); |
@H »⊕=« ($A,$B,$C,$D,$E); |
||
} |
} |
||
sub sha1(Blob $msg) returns Blob |
sub sha1(Blob $msg) returns Blob |
||
{ |
{ |
||
my @M = sha1-pad($msg); |
my @M = sha1-pad($msg); |
||
my @H = 0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0; |
my @H = 0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0; |
||
sha1-block(@H,@M[$_..$_+15]) for 0, 16...^ +@M; |
sha1-block(@H,@M[$_..$_+15]) for 0, 16...^ +@M; |
||
Blob.new: map { reverse .polymod(256 xx 3) }, @H; |
Blob.new: flat map { reverse .polymod(256 xx 3) }, @H; |
||
} |
} |
||
say sha1(.encode('ascii')), " $_" |
say sha1(.encode('ascii')), " $_" |
||
for 'abc', |
for 'abc', |
||
Revision as of 14:01, 8 September 2015
You are encouraged to solve this task according to the task description, using any language you may know.
SHA-1 or SHA1 is a one-way hash function; it computes a 160-bit message digest. SHA-1 often appears in security protocols; for example, many HTTPS websites use RSA with SHA-1 to secure their connections. BitTorrent uses SHA-1 to verify downloads. Git and Mercurial use SHA-1 digests to identify commits.
A US government standard, FIPS 180-1, defines SHA-1.
Find the SHA-1 message digest for a string of octets. You may either call a SHA-1 library, or implement SHA-1 in your language. Both approaches interest Rosetta Code.
Ada
<lang Ada>with Ada.Text_IO; with GNAT.SHA1;
procedure Main is begin
Ada.Text_IO.Put_Line ("SHA1 (""Rosetta Code"") = " &
GNAT.SHA1.Digest ("Rosetta Code"));
end Main;</lang>
Output:
SHA1 ("Rosetta Code") = 48c98f7e5a6e736d790ab740dfc3f51a61abe2b5
AutoHotkey
Source: SHA-1 @github by jNizM <lang AutoHotkey>str := "Rosetta Code" MsgBox, % "String:`n" (str) "`n`nSHA:`n" SHA(str)
- SHA ===============================================================================
SHA(string, encoding = "utf-8") {
return CalcStringHash(string, 0x8004, encoding)
}
- CalcAddrHash ======================================================================
CalcAddrHash(addr, length, algid, byref hash = 0, byref hashlength = 0) {
static h := [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, "A", "B", "C", "D", "E", "F"]
static b := h.minIndex()
o := ""
if (DllCall("advapi32\CryptAcquireContext", "Ptr*", hProv, "Ptr", 0, "Ptr", 0, "UInt", 24, "UInt", 0xF0000000))
{
if (DllCall("advapi32\CryptCreateHash", "Ptr", hProv, "UInt", algid, "UInt", 0, "UInt", 0, "Ptr*", hHash))
{
if (DllCall("advapi32\CryptHashData", "Ptr", hHash, "Ptr", addr, "UInt", length, "UInt", 0))
{
if (DllCall("advapi32\CryptGetHashParam", "Ptr", hHash, "UInt", 2, "Ptr", 0, "UInt*", hashlength, "UInt", 0))
{
VarSetCapacity(hash, hashlength, 0)
if (DllCall("advapi32\CryptGetHashParam", "Ptr", hHash, "UInt", 2, "Ptr", &hash, "UInt*", hashlength, "UInt", 0))
{
loop, % hashlength
{
v := NumGet(hash, A_Index - 1, "UChar")
o .= h[(v >> 4) + b] h[(v & 0xf) + b]
}
}
}
}
DllCall("advapi32\CryptDestroyHash", "Ptr", hHash)
}
DllCall("advapi32\CryPtreleaseContext", "Ptr", hProv, "UInt", 0)
}
return o
}
- CalcStringHash ====================================================================
CalcStringHash(string, algid, encoding = "utf-8", byref hash = 0, byref hashlength = 0) {
chrlength := (encoding = "cp1200" || encoding = "utf-16") ? 2 : 1 length := (StrPut(string, encoding) - 1) * chrlength VarSetCapacity(data, length, 0) StrPut(string, &data, floor(length / chrlength), encoding) return CalcAddrHash(&data, length, algid, hash, hashlength)
}</lang>
- Output:
String: Rosetta Code SHA-1: 48C98F7E5A6E736D790AB740DFC3F51A61ABE2B5
BBC BASIC
Library
<lang bbcbasic> PRINT FNsha1("Rosetta Code")
END
DEF FNsha1(message$)
LOCAL buflen%, buffer%, hprov%, hhash%, hash$, i%
CALG_SHA1 = &8004
CRYPT_VERIFYCONTEXT = &F0000000
HP_HASHVAL = 2
PROV_RSA_FULL = 1
buflen% = 64
DIM buffer% LOCAL buflen%-1
SYS "CryptAcquireContext", ^hprov%, 0, 0, PROV_RSA_FULL, CRYPT_VERIFYCONTEXT
SYS "CryptCreateHash", hprov%, CALG_SHA1, 0, 0, ^hhash%
SYS "CryptHashData", hhash%, message$, LEN(message$), 0
SYS "CryptGetHashParam", hhash%, HP_HASHVAL, buffer%, ^buflen%, 0
SYS "CryptDestroyHash", hhash%
SYS "CryptReleaseContext", hprov%
FOR i% = 0 TO buflen%-1
hash$ += RIGHT$("0" + STR$~buffer%?i%, 2)
NEXT
= hash$</lang>
Output:
48C98F7E5A6E736D790AB740DFC3F51A61ABE2B5
Native
<lang bbcbasic> *FLOAT64
PRINT FNsha1("Rosetta Code")
END
DEF FNsha1(message$)
LOCAL a%, b%, c%, d%, e%, f%, i%, j%, k%, l%, t%
LOCAL h0%, h1%, h2%, h3%, h4%, w%()
REM Initialize variables:
h0% = &67452301
h1% = &EFCDAB89
h2% = &98BADCFE
h3% = &10325476
h4% = &C3D2E1F0
l% = LEN(message$)*8
REM Pre-processing:
REM append the bit '1' to the message:
message$ += CHR$&80
REM append k bits '0', where k is the minimum number >= 0 such that
REM the resulting message length (in bits) is congruent to 448 (mod 512)
WHILE (LEN(message$) MOD 64) <> 56
message$ += CHR$0
ENDWHILE
REM append length of message (before pre-processing), in bits, as
REM 64-bit big-endian integer
FOR i% = 56 TO 0 STEP -8
message$ += CHR$(l% >>> i%)
NEXT
REM Process the message in successive 512-bit chunks:
REM break message into 512-bit chunks, for each chunk
REM break chunk into sixteen 32-bit big-endian words w[i], 0 <= i <= 15
DIM w%(79)
FOR j% = 0 TO LEN(message$) DIV 64 - 1
FOR i% = 0 TO 15
w%(i%) = !(!^message$ + 64*j% + 4*i%)
SWAP ?(^w%(i%)+0),?(^w%(i%)+3)
SWAP ?(^w%(i%)+1),?(^w%(i%)+2)
NEXT i%
REM Extend the sixteen 32-bit words into eighty 32-bit words:
FOR i% = 16 TO 79
w%(i%) = w%(i%-3) EOR w%(i%-8) EOR w%(i%-14) EOR w%(i%-16)
w%(i%) = (w%(i%) << 1) OR (w%(i%) >>> 31)
NEXT i%
REM Initialize hash value for this chunk:
a% = h0%
b% = h1%
c% = h2%
d% = h3%
e% = h4%
REM Main loop:
FOR i% = 0 TO 79
CASE TRUE OF
WHEN 0 <= i% AND i% <= 19
f% = (b% AND c%) OR ((NOT b%) AND d%)
k% = &5A827999
WHEN 20 <= i% AND i% <= 39
f% = b% EOR c% EOR d%
k% = &6ED9EBA1
WHEN 40 <= i% AND i% <= 59
f% = (b% AND c%) OR (b% AND d%) OR (c% AND d%)
k% = &8F1BBCDC
WHEN 60 <= i% AND i% <= 79
f% = b% EOR c% EOR d%
k% = &CA62C1D6
ENDCASE
t% = FN32(((a% << 5) OR (a% >>> 27)) + f% + e% + k% + w%(i%))
e% = d%
d% = c%
c% = (b% << 30) OR (b% >>> 2)
b% = a%
a% = t%
NEXT i%
REM Add this chunk's hash to result so far:
h0% = FN32(h0% + a%)
h1% = FN32(h1% + b%)
h2% = FN32(h2% + c%)
h3% = FN32(h3% + d%)
h4% = FN32(h4% + e%)
NEXT j%
= FNhex(h0%) + FNhex(h1%) + FNhex(h2%) + FNhex(h3%) + FNhex(h4%)
DEF FNhex(A%) = RIGHT$("0000000"+STR$~A%,8)
DEF FN32(n#)
WHILE n# > &7FFFFFFF : n# -= 2^32 : ENDWHILE
WHILE n# < &80000000 : n# += 2^32 : ENDWHILE
= n#</lang>
Output:
48C98F7E5A6E736D790AB740DFC3F51A61ABE2B5
C
<lang c>#include <stdio.h>
- include <stdlib.h>
- include <string.h>
- include <openssl/sha.h>
int main() {
int i;
unsigned char result[SHA_DIGEST_LENGTH];
const char *string = "Rosetta Code";
SHA1(string, strlen(string), result);
for(i = 0; i < SHA_DIGEST_LENGTH; i++)
printf("%02x%c", result[i], i < (SHA_DIGEST_LENGTH-1) ? ' ' : '\n');
return EXIT_SUCCESS;
}</lang>
C++
Compiling with g++ -lPocoCrypto shaexample.cpp -o shaexample:
<lang cpp>#include <string>
- include <iostream>
- include "Poco/SHA1Engine.h"
- include "Poco/DigestStream.h"
using Poco::DigestEngine ; using Poco::SHA1Engine ; using Poco::DigestOutputStream ;
int main( ) {
std::string myphrase ( "Rosetta Code" ) ;
SHA1Engine sha1 ;
DigestOutputStream outstr( sha1 ) ;
outstr << myphrase ;
outstr.flush( ) ; //to pass everything to the digest engine
const DigestEngine::Digest& digest = sha1.digest( ) ;
std::cout << myphrase << " as a sha1 digest :" << DigestEngine::digestToHex( digest )
<< " !" << std::endl ;
return 0 ;
}</lang> Output:
Rosetta Code as a sha1 digest :48c98f7e5a6e736d790ab740dfc3f51a61abe2b5 !
C#
Tests the built-in SHA1CryptoServiceProvider: <lang csharp>using System; using System.Security.Cryptography; using System.Text; using Microsoft.VisualStudio.TestTools.UnitTesting;
namespace RosettaCode.SHA1 {
[TestClass]
public class SHA1CryptoServiceProviderTest
{
[TestMethod]
public void TestComputeHash()
{
var input = new UTF8Encoding().GetBytes("Rosetta Code");
var output = new SHA1CryptoServiceProvider().ComputeHash(input);
Assert.AreEqual(
"48-C9-8F-7E-5A-6E-73-6D-79-0A-B7-40-DF-C3-F5-1A-61-AB-E2-B5",
BitConverter.ToString(output));
}
}
}</lang>
Caché ObjectScript
USER>set hash=$System.Encryption.SHA1Hash("Rosetta Code")
USER>zzdump hash
0000: 48 C9 8F 7E 5A 6E 73 6D 79 0A B7 40 DF C3 F5 1A
0010: 61 AB E2 B5
Clojure
As Clojure is interoperable with Java the solution to this task would be a small modification to MD5, as with Java. (Replacing "MD5" with "SHA-1" as noted here.)
Common Lisp
This example uses the Ironclad cryptography library (available via Quicklisp as well). <lang lisp>;;; in addition to sha1, ironclad provides sha224, sha256, sha384, and sha512. (defun sha1-hash (data)
(let ((sha1 (ironclad:make-digest 'ironclad:sha1))
(bin-data (ironclad:ascii-string-to-byte-array data)))
(ironclad:update-digest sha1 bin-data)
(ironclad:byte-array-to-hex-string (ironclad:produce-digest sha1))))
</lang>
D
<lang d>void main() {
import std.stdio, std.digest.sha;
writefln("%-(%02x%)", "Ars longa, vita brevis".sha1Of);
}</lang>
- Output:
e640d285242886eb96ab80cbf858389b3df52f43
Erlang
- Output:
12> crypto:hash( sha, "A string" ). <<110,185,174,8,151,66,9,104,174,225,10,43,9,92,82,190,197,150,224,92>>
Factor
Factor provides sha1 in the checksums.sha vocabulary. In Factor, checksum-bytes returns a sequence of bytes; hex-string converts this sequence to a hexadecimal string.
IN: scratchpad USING: checksums checksums.sha ; IN: scratchpad "Rosetta Code" sha1 checksum-bytes hex-string . "48c98f7e5a6e736d790ab740dfc3f51a61abe2b5"
The implementation is at basis/checksums/sha/sha.factor.
Go
<lang go>package main
import (
"crypto/sha1" "fmt"
)
func main() {
h := sha1.New()
h.Write([]byte("Rosetta Code"))
fmt.Printf("%x\n", h.Sum(nil))
}</lang> Output:
48c98f7e5a6e736d790ab740dfc3f51a61abe2b5
Haskell
<lang Haskell>module Digestor
where
import Data.Digest.Pure.SHA import qualified Data.ByteString.Lazy as B
convertString :: String -> B.ByteString convertString phrase = B.pack $ map ( fromIntegral . fromEnum ) phrase
convertToSHA1 :: String -> String convertToSHA1 word = showDigest $ sha1 $ convertString word
main = do
putStr "Rosetta Code SHA1-codiert: " putStrLn $ convertToSHA1 "Rosetta Code"
</lang>
- Output:
Rosetta Code SHA1-codiert: 48c98f7e5a6e736d790ab740dfc3f51a61abe2b5
J
J does not include an implementation of SHA-1. Thus:
<lang J>pad=: ,1,(0#~512 | [: - 65 + #),(64#2)#:#
f=:4 :0
'B C D'=: _32 ]\ y if. x < 20 do. (B*C)+.D>B elseif. x < 40 do. B~:C~:D elseif. x < 60 do. (B*C)+.(B*D)+.C*D elseif. x < 80 do. B~:C~:D end.
)
K=: ((32#2) #: 16b5a827999 16b6ed9eba1 16b8f1bbcdc 16bca62c1d6) {~ <.@%&20
plus=:+&.((32#2)&#.)
H=: #: 16b67452301 16befcdab89 16b98badcfe 16b10325476 16bc3d2e1f0
process=:4 :0
W=. (, [: , 1 |."#. _3 _8 _14 _16 ~:/@:{ ])^:64 x ]\~ _32
'A B C D E'=. y=._32[\,y
for_t. i.80 do.
TEMP=. (5|.A) plus (t f B,C,D) plus E plus (W{~t) plus K t
E=. D
D=. C
C=. 30 |. B
B=. A
A=. TEMP
end.
,y plus A,B,C,D,:E
)
sha1=: [:> [: process&.>/ (<H) (,~ |.) _512<\ pad</lang>
Example use:
<lang J> text2bits=: (8#2) ,@:#: a. i. ]
bits2hex=: '0123456789abcdef' {~ _4 #.\ ,
bits2hex sha1 text2bits 'Rosetta Code'
48c98f7e5a6e736d790ab740dfc3f51a61abe2b5</lang>
Remember that SHA-1 is an obsolete standard (and if you *really* want high speed you'd probably be using ASICs rather than a general purpose computing platform).
Java
The solution to this task would be a small modification to MD5 (replacing "MD5" with "SHA-1" as noted here).
Julia
Since the Nettle.jl package provides easy access to many cryptographic hashes, the core of this solution is a one-liner, but the testing bulks it out. This testing is inelegant, because I shy away from using a million character string as a dictionary key. See the Julia solution for RIPEMD-160 for an example of improved testing. <lang Julia> using Nettle
function sha1sum(s::String)
bytes2hex(sha1_hash(s))
end
println("Testing SHA-1 function against FIPS 180-1")
s = sha1sum("abc") t = lowercase("A9993E364706816ABA3E25717850C26C9CD0D89D") print(" \"abc\" should yield ", t) if s == t
println(", and it does.")
else
println(", but it yields ", s)
end
s = sha1sum("abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq") t = lowercase("84983E441C3BD26EBAAE4AA1F95129E5E54670F1") print(" \"abcdbc...\" should yield ", t) if s == t
println(", and it does.")
else
println(", but it yields ", s)
end
s = sha1sum("a"^10^6) t = lowercase("34AA973CD4C4DAA4F61EEB2BDBAD27316534016F") print(" a million \"a\"s should yield ", t) if s == t
println(", and it does.")
else
println(", but it yields ", s)
end
println("\nAlso") s = "Rosetta Code" h = sha1sum(s) println(" ", s, " => ", h) </lang>
- Output:
Testing SHA-1 function against FIPS 180-1
"abc" should yield a9993e364706816aba3e25717850c26c9cd0d89d, and it does.
"abcdbc..." should yield 84983e441c3bd26ebaae4aa1f95129e5e54670f1, and it does.
a million "a"s should yield 34aa973cd4c4daa4f61eeb2bdbad27316534016f, and it does.
Also
Rosetta Code => 48c98f7e5a6e736d790ab740dfc3f51a61abe2b5
Lasso
<lang Lasso>cipher_digest('Rosetta Code', -digest='SHA1',-hex=true)</lang>
- Output:
48c98f7e5a6e736d790ab740dfc3f51a61abe2b5
Liberty BASIC
<lang lb> '-------------------------------------------------------------------------------- ' FAST SHA1 CALCULATION BASED ON MS ADVAPI32.DLL BY CRYPTOMAN ' ' BASED ON SHA256 EXAMPLE BY RICHARD T. RUSSEL AUTHOR OF LBB ' ' http://lbb.conforums.com/ ' ' VERIFY CORRECTNESS BY http://www.fileformat.info/tool/hash.htm ' '--------------------------------------------------------------------------------
print sha1$("Rosetta Code") end
X$="1234567890ABCDEF"
dat$ = pack$(X$)
print "SPEED TEST"
for i=1 to 20
t1=time$("ms")
print sha1$(dat$)
t2=time$("ms")
print "calculated in ";t2-t1;" ms"
next
end
function sha1$(message$)
HP.HASHVAL = 2 CRYPT.NEWKEYSET = 48 PROV.RSA.AES = 24 buffer$ = space$(128)
PROVRSAFULL = 1 ALGCLASSHASH = 32768 ALGTYPEANY = 0 ALGSIDMD2 = 1 ALGSIDMD4 = 2 ALGSIDMD5 = 3 ALGSIDSHA1 = 4
ALGOSHA1 = ALGCLASSHASH OR ALGTYPEANY OR ALGSIDSHA1
struct temp, v as long
open "ADVAPI32.DLL" for dll as #advapi32
calldll #advapi32, "CryptAcquireContextA", temp as struct, _
0 as long, 0 as long, PROV.RSA.AES as long, _
0 as long, re as long
hprov = temp.v.struct
calldll #advapi32, "CryptCreateHash", hprov as long, _
ALGOSHA1 as long, 0 as long, 0 as long, _
temp as struct, re as long
hhash = temp.v.struct
l = len(message$)
calldll #advapi32, "CryptHashData", hhash as long, message$ as ptr, _
l as long, 0 as long, re as long
temp.v.struct = len(buffer$)
calldll #advapi32, "CryptGetHashParam", hhash as long, _
HP.HASHVAL as long, buffer$ as ptr, _
temp as struct, 0 as long, re as long
calldll #advapi32, "CryptDestroyHash", hhash as long, re as long
calldll #advapi32, "CryptReleaseContext", hprov as long, re as long
close #advapi32
for i = 1 TO temp.v.struct
sha1$ = sha1$ + right$("0" + dechex$(asc(mid$(buffer$,i))), 2)
next
end function
function pack$(x$)
for i = 1 TO len(x$) step 2
pack$ = pack$ + chr$(hexdec(mid$(x$,i,2)))
next
end function </lang>
- Output:
48C98F7E5A6E736D790AB740DFC3F51A61ABE2B5
LiveCode
<lang LiveCode>command shaRosettaCode
local shex, sha1
put sha1Digest("Rosetta Code") into sha1
get binaryDecode("H*",sha1,shex)
put shex
end shaRosettaCode</lang> Output
48c98f7e5a6e736d790ab740dfc3f51a61abe2b5
Lua
<lang Lua>#!/usr/bin/lua
local sha1 = require "sha1"
for i, str in ipairs{"Rosetta code", "Rosetta Code"} do
print(string.format("SHA-1(%q) = %s", str, sha1(str)))
end</lang>
- Output:
SHA-1("Rosetta code") = b18c883f4da750164b5af362ea9b9f27f90904b4
SHA-1("Rosetta Code") = 48c98f7e5a6e736d790ab740dfc3f51a61abe2b5
Mathematica
<lang Mathematica>IntegerString[Hash["Rosetta Code", "SHA1"], 16]
-> 48c98f7e5a6e736d790ab740dfc3f51a61abe2b5</lang>
NetRexx
This solution is basically the same as that for MD5, substituting "SHA-1" for "MD5" as the algorithm to use in the MessageDigest instance. <lang NetRexx>/* NetRexx */ options replace format comments java crossref savelog symbols binary
import java.security.MessageDigest
SHA1('Rosetta Code', '48c98f7e5a6e736d790ab740dfc3f51a61abe2b5')
return
-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ method SHA1(messageText, verifyCheck) public static
algorithm = 'SHA-1' digestSum = getDigest(messageText, algorithm)
say '<Message>'messageText'</Message>'
say Rexx('<'algorithm'>').right(12) || digestSum'</'algorithm'>'
say Rexx('<Verify>').right(12) || verifyCheck'</Verify>'
if digestSum == verifyCheck then say algorithm 'Confirmed'
else say algorithm 'Failed'
return
-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ method getDigest(messageText = Rexx, algorithm = Rexx 'MD5', encoding = Rexx 'UTF-8', lowercase = boolean 1) public static returns Rexx
algorithm = algorithm.upper encoding = encoding.upper
message = String(messageText) messageBytes = byte[] digestBytes = byte[] digestSum = Rexx
do messageBytes = message.getBytes(encoding) md = MessageDigest.getInstance(algorithm) md.update(messageBytes) digestBytes = md.digest
loop b_ = 0 to digestBytes.length - 1
bb = Rexx(digestBytes[b_]).d2x(2)
if lowercase then digestSum = digestSum || bb.lower
else digestSum = digestSum || bb.upper
end b_
catch ex = Exception
ex.printStackTrace
end
return digestSum
</lang> Output:
<Message>Rosetta Code</Message>
<SHA-1>48c98f7e5a6e736d790ab740dfc3f51a61abe2b5</SHA-1>
<Verify>48c98f7e5a6e736d790ab740dfc3f51a61abe2b5</Verify>
SHA-1 Confirmed
NewLISP
<lang NewLISP>;; using the crypto module from http://www.newlisp.org/code/modules/crypto.lsp.html
- (import native functions from the crypto library, provided by OpenSSL)
(module "crypto.lsp") (crypto:sha1 "Rosetta Code")</lang>
Nim
Compile with nim -d:ssl c sha1.nim:
<lang nim>import strutils
const SHA1Len = 20
proc SHA1(d: cstring, n: culong, md: cstring = nil): cstring {.cdecl, dynlib: "libssl.so", importc.}
proc SHA1(s: string): string =
result = "" var s = SHA1(s.cstring, s.len.culong) for i in 0 .. < SHA1Len: result.add s[i].BiggestInt.toHex(2).toLower
echo SHA1("Rosetta Code")</lang>
OCaml
Using the library ocaml-sha in the interactive loop:
<lang ocaml>$ ocaml -I +sha sha1.cma
Objective Caml version 3.12.1
- Sha1.to_hex (Sha1.string "Rosetta Code") ;;
- : string = "48c98f7e5a6e736d790ab740dfc3f51a61abe2b5"</lang>
Octave
Normally SHA-1 is available in the general package.
<lang octave>sprintf("%02x", SHA1(+"Rosetta Code"(:)))</lang>
- Output:
ans = 48c98f7e5a6e736d790ab740dfc3f51a61abe2b5
Pascal
<lang pascal>program RosettaSha1; uses
sha1;
var
d: TSHA1Digest;
begin
d:=SHA1String('Rosetta Code');
WriteLn(SHA1Print(d));
end.</lang>
- Output:
48c98f7e5a6e736d790ab740dfc3f51a61abe2b5
Perl
<lang perl>use Digest::SHA qw(sha1_hex);
print sha1_hex('Rosetta Code'), "\n";</lang>
- Output:
48c98f7e5a6e736d790ab740dfc3f51a61abe2b5
The same in OO manner <lang perl>use Digest::SHA;
my $sha1 = Digest::SHA->new(1); $sha1->add('Rosetta Code'); print $sha1->hexdigest, "\n";</lang>
Perl 6
A pure Perl 6 implementation that closely follows the description of SHA-1 in FIPS 180-1. Slow.
<lang perl6>sub postfix:<mod2³²> { $^x % 2**32 } sub infix:<⊕> { ($^x + $^y)mod2³² } sub S { ($^x +< $^n)mod2³² +| ($x +> (32-$n)) }
my \f = -> \B,\C,\D { (B +& C) +| ((+^B)mod2³² +& D) },
-> \B,\C,\D { B +^ C +^ D },
-> \B,\C,\D { (B +& C) +| (B +& D) +| (C +& D) },
-> \B,\C,\D { B +^ C +^ D };
my \K = 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xCA62C1D6;
sub sha1-pad(Blob $msg) {
my \bits = 8 * $msg.elems;
my @padded = flat $msg.list, 0x80, 0x00 xx (-($msg.elems + 1 + 8) % 64);
flat @padded.map({ :256[$^a,$^b,$^c,$^d] }), (bits +> 32)mod2³², (bits)mod2³²;
}
sub sha1-block(@H is rw, @M is copy) {
@M.push: S(1, [+^] @M[$_ «-« <3 8 14 16>] ) for 16 .. 79;
my ($A,$B,$C,$D,$E) = @H;
for 0..79 -> \t {
($A, $B, $C, $D, $E) =
S(5,$A) ⊕ f[t div 20]($B,$C,$D) ⊕ $E ⊕ @M[t] ⊕ K[t div 20],
$A, S(30,$B), $C, $D;
}
@H »⊕=« ($A,$B,$C,$D,$E);
}
sub sha1(Blob $msg) returns Blob {
my @M = sha1-pad($msg);
my @H = 0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0;
sha1-block(@H,@M[$_..$_+15]) for 0, 16...^ +@M;
Blob.new: flat map { reverse .polymod(256 xx 3) }, @H;
}
say sha1(.encode('ascii')), " $_"
for 'abc',
'abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq',
'Rosetta Code',
'Ars longa, vita brevis';</lang>
- Output:
Buf:0x<a9 99 3e 36 47 06 81 6a ba 3e 25 71 78 50 c2 6c 9c d0 d8 9d> abc Buf:0x<84 98 3e 44 1c 3b d2 6e ba ae 4a a1 f9 51 29 e5 e5 46 70 f1> abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq Buf:0x<48 c9 8f 7e 5a 6e 73 6d 79 0a b7 40 df c3 f5 1a 61 ab e2 b5> Rosetta Code Buf:0x<e6 40 d2 85 24 28 86 eb 96 ab 80 cb f8 58 38 9b 3d f5 2f 43> Ars longa, vita brevis
PHP
<lang php><?php $string = 'Rosetta Code'; echo sha1( $string ), "\n"; ?></lang>
- Output:
48c98f7e5a6e736d790ab740dfc3f51a61abe2b5
PicoLisp
Library and implementation. <lang PicoLisp>(de leftRotate (X C)
(| (mod32 (>> (- C) X)) (>> (- 32 C) X)) )
(de mod32 (N)
(& N `(hex "FFFFFFFF")) )
(de not32 (N)
(x| N `(hex "FFFFFFFF")) )
(de add32 @
(mod32 (pass +)) )
(de sha1 (Str)
(let Len (length Str)
(setq Str
(conc
(need
(-
8
(* 64 (/ (+ Len 1 8 63) 64)) )
(conc
(mapcar char (chop Str))
(cons `(hex "80")) )
0 )
(flip
(make
(setq Len (* 8 Len))
(do 8
(link (& Len 255))
(setq Len (>> 8 Len )) ) ) ) ) ) )
(let
(H0 `(hex "67452301")
H1 `(hex "EFCDAB89")
H2 `(hex "98BADCFE")
H3 `(hex "10325476")
H4 `(hex "C3D2E1F0") )
(while Str
(let
(A H0 B H1 C H2 D H3 E H4
W (conc
(make
(do 16
(link
(apply
|
(mapcar >> (-24 -16 -8 0) (cut 4 'Str)) ) ) ) )
(need 64 0) ) )
(for (I 17 (>= 80 I) (inc I))
(set (nth W I)
(leftRotate
(x|
(get W (- I 3))
(get W (- I 8))
(get W (- I 14))
(get W (- I 16)) )
1 ) ) )
(use (Tmp F K)
(for I 80
(cond
((>= 20 I)
(setq
F (| (& B C) (& (not32 B) D))
K `(hex "5A827999") ) )
((>= 40 I)
(setq
F (x| B C D)
K `(hex "6ED9EBA1") ) )
((>= 60 I)
(setq
F (| (& B C) (& B D) (& C D))
K `(hex "8F1BBCDC") ) )
(T
(setq
F (x| B C D)
K `(hex "CA62C1D6") ) ) )
(setq
Tmp (add32 (leftRotate A 5) F E K (get W I) )
E D
D C
C (leftRotate B 30)
B A
A Tmp ) ) )
(setq
H0 (add32 H0 A)
H1 (add32 H1 B)
H2 (add32 H2 C)
H3 (add32 H3 D)
H4 (add32 H4 E) ) ) )
(mapcan
'((N)
(flip
(make
(do 4
(link (& 255 N))
(setq N (>> 8 N)) ) ) ) )
(list H0 H1 H2 H3 H4) ) ) )
(let Str "Rosetta Code"
(println
(pack
(mapcar
'((B) (pad 2 (hex B)))
(sha1 Str) ) ) )
(println
(pack
(mapcar
'((B) (pad 2 (hex B)))
(native
"libcrypto.so"
"SHA1"
'(B . 20)
Str
(length Str)
'(NIL (20)) ) ) ) ) )
(bye)</lang>
PowerShell
<lang PowerShell> Function Calculate-SHA1( $String ){
$Enc = [system.Text.Encoding]::UTF8 $Data = $enc.GetBytes($String)
# Create a New SHA1 Crypto Provider $Sha = New-Object System.Security.Cryptography.SHA1CryptoServiceProvider
# Now hash and display results $Result = $sha.ComputeHash($Data) [System.Convert]::ToBase64String($Result)
} </lang> taken from Stackoverflow with a little modification
Python
<lang python>import hashlib h = hashlib.sha1() h.update(bytes("Ars longa, vita brevis", encoding="ASCII")) h.hexdigest()
- "e640d285242886eb96ab80cbf858389b3df52f43"</lang>
Racket
With the built-in file/sha1 library:
<lang racket>
- lang racket
(require file/sha1) (sha1 (open-input-string "Rosetta Code")) </lang>
With the faster openssl/sha1 library (requires OpenSSL to be installed):
<lang racket>
- lang racket
(require openssl/sha1) (sha1 (open-input-string "Rosetta Code")) </lang>
Ruby
These programs print the SHA-1 of 'Rosetta Code', which is 48c98f7e5a6e736d790ab740dfc3f51a61abe2b5.
First: Use 'digest' from Ruby's standard library. <lang ruby>require 'digest' puts Digest::SHA1.hexdigest('Rosetta Code')</lang>
Second: Use 'openssl' from Ruby's standard library.
<lang ruby>require 'openssl' puts OpenSSL::Digest::SHA1.hexdigest('Rosetta Code')</lang>
Third: Reimplement SHA-1 in Ruby. <lang ruby>require 'stringio'
- Calculates SHA-1 message digest of _string_. Returns binary digest.
- For hexadecimal digest, use +*sha1(string).unpack('H*')+.
- --
- This is a simple, pure-Ruby implementation of SHA-1, following
- the algorithm in FIPS 180-1.
- ++
def sha1(string)
# functions and constants
mask = 0xffffffff
s = proc{|n, x| ((x << n) & mask) | (x >> (32 - n))}
f = [
proc {|b, c, d| (b & c) | (b.^(mask) & d)},
proc {|b, c, d| b ^ c ^ d},
proc {|b, c, d| (b & c) | (b & d) | (c & d)},
proc {|b, c, d| b ^ c ^ d},
].freeze
k = [0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6].freeze
# initial hash
h = [0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0]
bit_len = string.size << 3
string += "\x80"
while (string.size % 64) != 56
string += "\0"
end
string = string.force_encoding('ascii-8bit') + [bit_len >> 32, bit_len & mask].pack("N2")
if string.size % 64 != 0
fail "failed to pad to correct length"
end
io = StringIO.new(string)
block = ""
while io.read(64, block)
w = block.unpack("N16")
# Process block.
(16..79).each {|t| w[t] = s[1, w[t-3] ^ w[t-8] ^ w[t-14] ^ w[t-16]]}
a, b, c, d, e = h
t = 0
4.times do |i|
20.times do
temp = (s[5, a] + f[i][b, c, d] + e + w[t] + k[i]) & mask
a, b, c, d, e = temp, a, s[30, b], c, d
t += 1
end
end
[a,b,c,d,e].each_with_index {|x,i| h[i] = (h[i] + x) & mask}
end
h.pack("N5")
end
if __FILE__ == $0
# Print some example SHA-1 digests.
# FIPS 180-1 has correct digests for 'abc' and 'abc...opq'.
[ 'abc',
'abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq',
'Rosetta Code',
].each {|s| printf("%s:\n %s\n", s, *sha1(s).unpack('H*'))}
end</lang>
- Output:
abc: a9993e364706816aba3e25717850c26c9cd0d89d abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq: 84983e441c3bd26ebaae4aa1f95129e5e54670f1 Rosetta Code: 48c98f7e5a6e736d790ab740dfc3f51a61abe2b5
Scala
The solution to this task would be a small modification to MD5 (replacing "MD5" with "SHA-1" as noted here).
<lang scala> import java.nio._
case class Hash(message: List[Byte]) {
val defaultHashes = List(0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0)
val hash = {
val padded = generatePadding(message)
val chunks: List[List[Byte]] = messageToChunks(padded)
toHashForm(hashesFromChunks(chunks))
}
def generatePadding(message: List[Byte]): List[Byte] = {
val finalPadding = BigInt(message.length * 8).toByteArray match {
case x => List.fill(8 - x.length)(0.toByte) ++ x
}
val padding = (message.length + 1) % 64 match {
case l if l < 56 =>
message ::: 0x80.toByte :: List.fill(56 - l)(0.toByte)
case l =>
message ::: 0x80.toByte :: List.fill((64 - l) + 56 + 1)(0.toByte)
}
padding ::: finalPadding
}
def toBigEndian(bytes: List[Byte]) = ByteBuffer.wrap(bytes.toArray).getInt
def messageToChunks(message: List[Byte]) = message.grouped(64).toList
def chunkToWords(chunk: List[Byte]) = chunk.grouped(4).map(toBigEndian).toList
def extendWords(words: List[Int]): List[Int] = words.length match {
case i if i < 80 => extendWords(words :+ Integer.rotateLeft(
(words(i - 3) ^ words(i - 8) ^ words(i - 14) ^ words(i - 16)), 1))
case _ => words
}
def generateFK(i: Int, b: Int, c: Int, d: Int) = i match {
case i if i < 20 => (b & c | ~b & d, 0x5A827999)
case i if i < 40 => (b ^ c ^ d, 0x6ED9EBA1)
case i if i < 60 => (b & c | b & d | c & d, 0x8F1BBCDC)
case i if i < 80 => (b ^ c ^ d, 0xCA62C1D6)
}
def generateHash(words: List[Int], prevHash: List[Int]): List[Int] = {
def generateHash(i: Int, currentHashes: List[Int]): List[Int] = i match {
case i if i < 80 => currentHashes match {
case a :: b :: c :: d :: e :: Nil => {
val (f, k) = generateFK(i, b, c, d)
val x = Integer.rotateLeft(a, 5) + f + e + k + words(i)
val t = Integer.rotateLeft(b, 30)
generateHash(i + 1, x :: a :: t :: c :: d :: Nil)
}
}
case _ => currentHashes
}
addHashes(prevHash, generateHash(0, prevHash))
}
def addHashes(xs: List[Int], ys: List[Int]) = (xs, ys).zipped.map(_ + _)
def hashesFromChunks(chunks: List[List[Byte]],
remainingHash: List[Int] = defaultHashes): List[Int] =
chunks match {
case Nil => remainingHash
case x :: xs => {
val words = extendWords(chunkToWords(x))
val newHash = generateHash(words, remainingHash)
hashesFromChunks(xs, newHash)
}
}
def toHashForm(hashes: List[Int]) =
hashes.map(b => ByteBuffer.allocate(4)
.order(ByteOrder.BIG_ENDIAN).putInt(b).array.toList)
.map(bytesToHex).mkString
def bytesToHex(bytes: List[Byte]) =
(for (byte <- bytes) yield (Character.forDigit((byte >> 4) & 0xF, 16) ::
Character.forDigit((byte & 0xF), 16) :: Nil).mkString).mkString
}
object Hash extends App {
def hash(message: String) = new Hash(message.getBytes.toList).hash
println(hash("Rosetta Code"))
} </lang>
- Output:
48c98f7e5a6e736d790ab740dfc3f51a61abe2b5
Seed7
<lang seed7>$ include "seed7_05.s7i";
include "msgdigest.s7i";
const proc: main is func
begin
writeln(hex(sha1("Rosetta Code")));
end func;</lang>
- Output:
48c98f7e5a6e736d790ab740dfc3f51a61abe2b5
Sidef
<lang ruby>var sha = frequire('Digest::SHA'); say sha.sha1_hex('Rosetta Code');</lang>
- Output:
48c98f7e5a6e736d790ab740dfc3f51a61abe2b5
Smalltalk
<lang smalltalk>PackageLoader fileInPackage: 'Digest'. (SHA1 hexDigestOf: 'Rosetta Code') displayNl.</lang>
<lang smalltalk>(SHA1Stream hashValueOf:'Rosetta Code')</lang>
Tcl
<lang tcl>package require sha1 puts [sha1::sha1 "Rosetta Code"]</lang> Output:
48c98f7e5a6e736d790ab740dfc3f51a61abe2b5
It should be noted that the sha1 package is actually a façade that uses an efficient implementation in C if one is available, or a pure Tcl version otherwise.
UNIX Shell
<lang bash>$ echo -n 'ASCII string' | sha1 9e9aeefe5563845ec5c42c5630842048c0fc261b</lang>
<lang bash>$ echo -n 'ASCII string' | openssl sha1 | sed 's/.*= //' 9e9aeefe5563845ec5c42c5630842048c0fc261b</lang>
zkl
Using zklMsgHash so. Can return the hash as a string of hex digits or bytes, can hash the hash N times. <lang zkl>$ zkl // run the REPL zkl: var MsgHash=Import("zklMsgHash") MsgHash zkl: MsgHash.SHA1("Rosetta Code") 48c98f7e5a6e736d790ab740dfc3f51a61abe2b5
zkl: var hash=MsgHash.SHA1("Rosetta Code",1,False) // hash once, return hash as bytes Data(20) zkl: hash.bytes() L(72,201,143,126,90,110,115,109,121,10,183,64,223,195,245,26,97,171,226,181) zkl: hash.bytes().apply("toString",16).concat() 48c98f7e5a6e736d79ab740dfc3f51a61abe2b5
zkl: MsgHash.SHA1("a"*1000,1000); // hash 1000 a's 1000 times 34aa973cd4c4daa4f61eeb2bdbad27316534016f</lang>
- Programming Tasks
- Solutions by Programming Task
- Checksums
- Ada
- AutoHotkey
- BBC BASIC
- C
- OpenSSL
- C++
- Poco
- C sharp
- Caché ObjectScript
- Clojure
- Common Lisp
- Ironclad
- D
- Erlang
- Factor
- Go
- Haskell
- J
- Java
- Julia
- Lasso
- Liberty BASIC
- LiveCode
- Lua
- Sha1
- Mathematica
- NetRexx
- NewLISP
- Nim
- OCaml
- Octave
- Pascal
- Perl
- Perl 6
- PHP
- PicoLisp
- PowerShell
- Python
- Racket
- Ruby
- Scala
- Seed7
- Sidef
- Smalltalk
- Tcl
- Tcllib
- UNIX Shell
- Zkl
- Lilypond/Omit
- TUSCRIPT/Omit