diff --git a/src/tests/test_condensed.py b/src/tests/test_condensed.py
--- a/src/tests/test_condensed.py
+++ b/src/tests/test_condensed.py
@@ -5,7 +5,7 @@ import random
 from unittest import TestCase
 
 from gf256 import _gfmul, evaluate
-from shamira import generateRaw, generate
+from shamira import generate_raw, generate
 from condensed import *
 
 
@@ -21,47 +21,47 @@ class TestCondensed(TestCase):
 	def tearDownClass(cls):
 		os.urandom = cls._urandom
 
-	def testGfmul(self):
+	def test_gfmul(self):
 		for a in range(256):
 			for b in range(256):
 				self.assertEqual(_gfmul(a, b), gfmul(a, b))
 
-	def testGetConstantCoef(self):
-		self.assertEqual(getConstantCoef((1, 1), (2, 2), (3, 3)), 0)
+	def test_get_constant_coef(self):
+		self.assertEqual(get_constant_coef((1, 1), (2, 2), (3, 3)), 0)
 
 		random.seed(17)
-		randomMatches = 0
+		random_matches = 0
 		for i in range(10):
 			k = random.randint(2, 255)
 
 			# exact
-			res = self.checkCoefsMatch(k, k)
+			res = self.check_coefs_match(k, k)
 			self.assertEqual(res[0], res[1])
 
 			# overdetermined
-			res = self.checkCoefsMatch(k, 256)
+			res = self.check_coefs_match(k, 256)
 			self.assertEqual(res[0], res[1])
 
 			# underdetermined => random
-			res = self.checkCoefsMatch(k, k-1)
+			res = self.check_coefs_match(k, k-1)
 			if res[0]==res[1]:
-				randomMatches += 1
-		self.assertLess(randomMatches, 2)  # with a chance (255/256)**10=0.96 there should be no match
+				random_matches += 1
+		self.assertLess(random_matches, 2)  # with a chance (255/256)**10=0.96 there should be no match
 
-	def checkCoefsMatch(self, k, m):
+	def check_coefs_match(self, k, m):
 		coefs = [random.randint(0, 255) for i in range(k)]
 		points = [(j, evaluate(coefs, j)) for j in range(1, 256)]
 		random.shuffle(points)
-		return (getConstantCoef(*points[:m]), coefs[0])
+		return (get_constant_coef(*points[:m]), coefs[0])
 
-	def testGenerateReconstructRaw(self):
+	def test_generate_reconstruct_raw(self):
 		for (k, n) in [(2, 3), (254, 254)]:
-			shares = generateRaw(b"abcd", k, n)
+			shares = generate_raw(b"abcd", k, n)
 			random.shuffle(shares)
-			self.assertEqual(reconstructRaw(*shares[:k]), b"abcd")
-			self.assertNotEqual(reconstructRaw(*shares[:k-1]), b"abcd")
+			self.assertEqual(reconstruct_raw(*shares[:k]), b"abcd")
+			self.assertNotEqual(reconstruct_raw(*shares[:k-1]), b"abcd")
 
-	def testGenerateReconstruct(self):
+	def test_generate_reconstruct(self):
 		for secret in ["abcde", "ěščřžý"]:
 			for (k, n) in [(2, 3), (254, 254)]:
 				with self.subTest(sec=secret, k=k, n=n):
@@ -76,7 +76,7 @@ class TestCondensed(TestCase):
 		with self.assertRaises(SException):
 			reconstruct(*shares)
 
-	def testDecode(self):
+	def test_decode(self):
 		with self.assertRaises(SException):
 			decode("AAA")
 			decode("1.")