2013-07-04 20:56:19 +00:00
|
|
|
/*
|
|
|
|
* ZeroTier One - Global Peer to Peer Ethernet
|
|
|
|
* Copyright (C) 2012-2013 ZeroTier Networks LLC
|
|
|
|
*
|
|
|
|
* This program is free software: you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*
|
|
|
|
* --
|
|
|
|
*
|
|
|
|
* ZeroTier may be used and distributed under the terms of the GPLv3, which
|
|
|
|
* are available at: http://www.gnu.org/licenses/gpl-3.0.html
|
|
|
|
*
|
|
|
|
* If you would like to embed ZeroTier into a commercial application or
|
|
|
|
* redistribute it in a modified binary form, please contact ZeroTier Networks
|
|
|
|
* LLC. Start here: http://www.zerotier.com/
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <stdint.h>
|
|
|
|
|
2013-09-17 20:49:16 +00:00
|
|
|
#include "Constants.hpp"
|
2013-07-04 20:56:19 +00:00
|
|
|
#include "Identity.hpp"
|
2013-09-16 17:57:57 +00:00
|
|
|
#include "SHA512.hpp"
|
2013-09-16 18:47:48 +00:00
|
|
|
#include "Salsa20.hpp"
|
2013-10-05 10:00:47 +00:00
|
|
|
#include "Utils.hpp"
|
2013-07-04 20:56:19 +00:00
|
|
|
|
2013-10-05 18:15:59 +00:00
|
|
|
// These can't be changed without a new identity type. They define the
|
|
|
|
// parameters of the hashcash hashing/searching algorithm.
|
|
|
|
#define ZT_IDENTITY_GEN_HASHCASH_FIRST_BYTE_LESS_THAN 5
|
|
|
|
#define ZT_IDENTITY_GEN_MEMORY 8388608
|
2013-10-05 11:00:55 +00:00
|
|
|
|
2013-07-04 20:56:19 +00:00
|
|
|
namespace ZeroTier {
|
|
|
|
|
2013-10-06 09:28:25 +00:00
|
|
|
// A memory-hard composition of SHA-512 and Salsa20 for hashcash hashing
|
|
|
|
static inline void _computeMemoryHardHash(const void *publicKey,unsigned int publicKeyBytes,void *sha512digest,unsigned char *genmem)
|
2013-10-05 18:15:59 +00:00
|
|
|
{
|
|
|
|
// Step 1: hash key to generate Salsa20 key and nonce
|
|
|
|
SHA512::hash(sha512digest,publicKey,publicKeyBytes);
|
|
|
|
|
|
|
|
// Step 2: copy key into genmen[], zero rest, encrypt with Salsa20
|
|
|
|
Salsa20 s20(sha512digest,256,((char *)sha512digest) + 32);
|
|
|
|
memcpy(genmem,publicKey,publicKeyBytes);
|
|
|
|
memset(genmem + publicKeyBytes,0,ZT_IDENTITY_GEN_MEMORY - publicKeyBytes);
|
|
|
|
s20.encrypt(genmem,genmem,ZT_IDENTITY_GEN_MEMORY);
|
|
|
|
|
|
|
|
// Step 3: hash the encrypted public key and the rest of the
|
|
|
|
// genmem[] bytes of Salsa20 key stream to yield the final hash.
|
|
|
|
SHA512::hash(sha512digest,genmem,ZT_IDENTITY_GEN_MEMORY);
|
|
|
|
}
|
|
|
|
|
2013-10-06 09:28:25 +00:00
|
|
|
// Hashcash generation halting condition -- halt when first byte is less than
|
|
|
|
// threshold value.
|
2013-10-05 10:00:47 +00:00
|
|
|
struct _Identity_generate_cond
|
|
|
|
{
|
|
|
|
_Identity_generate_cond() throw() {}
|
2013-10-06 09:28:25 +00:00
|
|
|
_Identity_generate_cond(unsigned char *sb,unsigned char *gm) throw() : sha512digest(sb),genmem(gm) {}
|
2013-10-05 10:00:47 +00:00
|
|
|
inline bool operator()(const C25519::Pair &kp) const
|
|
|
|
throw()
|
|
|
|
{
|
2013-10-06 09:28:25 +00:00
|
|
|
_computeMemoryHardHash(kp.pub.data,kp.pub.size(),sha512digest,genmem);
|
2013-10-05 18:15:59 +00:00
|
|
|
return (sha512digest[0] < ZT_IDENTITY_GEN_HASHCASH_FIRST_BYTE_LESS_THAN);
|
2013-10-05 10:00:47 +00:00
|
|
|
}
|
2013-10-06 09:28:25 +00:00
|
|
|
unsigned char *sha512digest,*genmem;
|
2013-10-05 10:00:47 +00:00
|
|
|
};
|
|
|
|
|
2013-07-04 20:56:19 +00:00
|
|
|
void Identity::generate()
|
|
|
|
{
|
2013-10-05 18:15:59 +00:00
|
|
|
unsigned char sha512digest[64];
|
2013-10-06 09:28:25 +00:00
|
|
|
unsigned char *genmem = new unsigned char[ZT_IDENTITY_GEN_MEMORY];
|
2013-10-05 10:00:47 +00:00
|
|
|
|
2013-09-16 13:20:59 +00:00
|
|
|
C25519::Pair kp;
|
2013-07-04 20:56:19 +00:00
|
|
|
do {
|
2013-10-06 09:28:25 +00:00
|
|
|
kp = C25519::generateSatisfying(_Identity_generate_cond(sha512digest,genmem));
|
2013-10-05 18:15:59 +00:00
|
|
|
_address.setTo(sha512digest + 59,ZT_ADDRESS_LENGTH); // last 5 bytes are address
|
2013-07-04 20:56:19 +00:00
|
|
|
} while (_address.isReserved());
|
2013-09-16 13:20:59 +00:00
|
|
|
|
|
|
|
_publicKey = kp.pub;
|
|
|
|
if (!_privateKey)
|
|
|
|
_privateKey = new C25519::Private();
|
|
|
|
*_privateKey = kp.priv;
|
2013-10-06 09:28:25 +00:00
|
|
|
|
|
|
|
delete [] genmem;
|
2013-07-04 20:56:19 +00:00
|
|
|
}
|
|
|
|
|
2013-10-05 11:00:55 +00:00
|
|
|
bool Identity::locallyValidate() const
|
2013-07-04 20:56:19 +00:00
|
|
|
{
|
2013-10-05 14:19:12 +00:00
|
|
|
if (_address.isReserved())
|
|
|
|
return false;
|
2013-10-05 18:15:59 +00:00
|
|
|
|
|
|
|
unsigned char sha512digest[64];
|
2013-10-06 09:28:25 +00:00
|
|
|
unsigned char *genmem = new unsigned char[ZT_IDENTITY_GEN_MEMORY];
|
|
|
|
_computeMemoryHardHash(_publicKey.data,_publicKey.size(),sha512digest,genmem);
|
|
|
|
delete [] genmem;
|
2013-10-05 18:15:59 +00:00
|
|
|
|
|
|
|
unsigned char addrb[5];
|
2013-10-05 11:00:55 +00:00
|
|
|
_address.copyTo(addrb,5);
|
2013-10-05 18:15:59 +00:00
|
|
|
|
2013-10-05 11:00:55 +00:00
|
|
|
return (
|
2013-10-05 18:15:59 +00:00
|
|
|
(sha512digest[0] < ZT_IDENTITY_GEN_HASHCASH_FIRST_BYTE_LESS_THAN)&&
|
|
|
|
(sha512digest[59] == addrb[0])&&
|
|
|
|
(sha512digest[60] == addrb[1])&&
|
|
|
|
(sha512digest[61] == addrb[2])&&
|
|
|
|
(sha512digest[62] == addrb[3])&&
|
|
|
|
(sha512digest[63] == addrb[4]));
|
2013-07-04 20:56:19 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
std::string Identity::toString(bool includePrivate) const
|
|
|
|
{
|
|
|
|
std::string r;
|
2013-09-16 13:20:59 +00:00
|
|
|
|
2013-07-04 20:56:19 +00:00
|
|
|
r.append(_address.toString());
|
2013-10-05 10:00:47 +00:00
|
|
|
r.append(":0:"); // 0 == IDENTITY_TYPE_C25519
|
2013-09-16 17:02:10 +00:00
|
|
|
r.append(Utils::hex(_publicKey.data,_publicKey.size()));
|
|
|
|
if ((_privateKey)&&(includePrivate)) {
|
|
|
|
r.push_back(':');
|
2013-09-16 17:57:57 +00:00
|
|
|
r.append(Utils::hex(_privateKey->data,_privateKey->size()));
|
2013-09-16 17:02:10 +00:00
|
|
|
}
|
2013-09-16 13:20:59 +00:00
|
|
|
|
2013-07-04 20:56:19 +00:00
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool Identity::fromString(const char *str)
|
|
|
|
{
|
2013-09-16 17:02:10 +00:00
|
|
|
char *saveptr = (char *)0;
|
|
|
|
char tmp[4096];
|
|
|
|
if (!Utils::scopy(tmp,sizeof(tmp),str))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
delete _privateKey;
|
|
|
|
_privateKey = (C25519::Private *)0;
|
|
|
|
|
|
|
|
int fno = 0;
|
|
|
|
for(char *f=Utils::stok(tmp,":",&saveptr);(f);f=Utils::stok((char *)0,":",&saveptr)) {
|
|
|
|
switch(fno++) {
|
|
|
|
case 0:
|
|
|
|
_address = Address(f);
|
|
|
|
if (_address.isReserved())
|
|
|
|
return false;
|
|
|
|
break;
|
|
|
|
case 1:
|
2013-10-05 10:00:47 +00:00
|
|
|
if (f[0] != '0')
|
2013-09-16 17:02:10 +00:00
|
|
|
return false;
|
|
|
|
break;
|
|
|
|
case 2:
|
|
|
|
if (Utils::unhex(f,_publicKey.data,_publicKey.size()) != _publicKey.size())
|
|
|
|
return false;
|
|
|
|
break;
|
|
|
|
case 3:
|
|
|
|
_privateKey = new C25519::Private();
|
|
|
|
if (Utils::unhex(f,_privateKey->data,_privateKey->size()) != _privateKey->size())
|
|
|
|
return false;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
2013-10-05 18:15:59 +00:00
|
|
|
if (fno < 3)
|
2013-09-16 17:02:10 +00:00
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
2013-07-04 20:56:19 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
} // namespace ZeroTier
|
|
|
|
|