X-Git-Url: http://www.git.cypherpunks.ru/?a=blobdiff_plain;f=pygost%2Futils.py;h=632eb2f2de6dfc58e4fb87c6433179c8982a4f61;hb=9af4461c6af50f9cf83030867e7054d1f6311b32;hp=8718792deee3278bfba36117c9ca8444b42c2a3c;hpb=5ecaafbe1a87f9a311a18574653e6dbc75a776b9;p=pygost.git diff --git a/pygost/utils.py b/pygost/utils.py index 8718792..632eb2f 100644 --- a/pygost/utils.py +++ b/pygost/utils.py @@ -1,6 +1,6 @@ # coding: utf-8 # PyGOST -- Pure Python GOST cryptographic functions library -# Copyright (C) 2015-2019 Sergey Matveev +# Copyright (C) 2015-2021 Sergey Matveev # # 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 @@ -19,11 +19,11 @@ from codecs import getencoder from sys import version_info -xrange = range if version_info[0] == 3 else xrange # pylint: disable=redefined-builtin +xrange = range if version_info[0] == 3 else xrange def strxor(a, b): - """ XOR of two strings + """XOR of two strings This function will process only shortest length of both strings, ignoring remaining one. @@ -52,7 +52,7 @@ def hexenc(data): def bytes2long(raw): - """ Deserialize big-endian bytes into long number + """Deserialize big-endian bytes into long number :param bytes raw: binary string :returns: deserialized long number @@ -62,7 +62,7 @@ def bytes2long(raw): def long2bytes(n, size=32): - """ Serialize long number into big-endian bytestring + """Serialize long number into big-endian bytestring :param long n: long number :returns: serialized bytestring @@ -78,7 +78,7 @@ def long2bytes(n, size=32): def modinvert(a, n): - """ Modular multiplicative inverse + """Modular multiplicative inverse :returns: inverse number. -1 if it does not exist