Algebraic cryptography: new constructions and their security against provable break

Grigoriev, D.; Kojevnikov, A.; Nikolenko, S.

doi:10.1090/S1061-0022-09-01079-6

Algebraic cryptography: new constructions and their security against provable break
HTML articles powered by AMS MathViewer

by D. Grigoriev, A. Kojevnikov and S. J. Nikolenko
Translated by: the authors

St. Petersburg Math. J. 20 (2009), 937-953

DOI: https://doi.org/10.1090/S1061-0022-09-01079-6

Published electronically: October 1, 2009

PDF | Request permission

Abstract:

Very few known cryptographic primitives are based on noncommutative algebra. Each new scheme is of substantial interest, because noncommutative constructions are secure against many standard cryptographic attacks. On the other hand, cryptography does not provide security proofs that might allow the security of a cryptographic primitive to rely upon structural complexity assumptions. Thus, it is important to investigate weaker notions of security.

In this paper, new constructions of cryptographic primitives based on group invariants are proposed, together with new ways to strengthen them for practical use. Also, the notion of a provable break is introduced, which is a weaker version of the regular cryptographic break. In this new version, an adversary should have a proof that he has correctly decyphered the message. It is proved that the cryptosystems based on matrix group invariants and a version of the Anshel–Anshel–Goldfeld key agreement protocol for modular groups are secure against provable break unless $\mathrm {NP}=\mathrm {RP}$.

References

Miklós Ajtai and Cynthia Dwork, A public-key cryptosystem with worst-case/average-case equivalence, STOC ’97 (El Paso, TX), ACM, New York, 1999, pp. 284–293. MR 1715640
Iris Anshel, Michael Anshel, Benji Fisher, and Dorian Goldfeld, New key agreement protocols in braid group cryptography, Topics in cryptology—CT-RSA 2001 (San Francisco, CA), Lecture Notes in Comput. Sci., vol. 2020, Springer, Berlin, 2001, pp. 13–27. MR 1907085, DOI 10.1007/3-540-45353-9_{2}
Iris Anshel, Michael Anshel, and Dorian Goldfeld, An algebraic method for public-key cryptography, Math. Res. Lett. 6 (1999), no. 3-4, 287–291. MR 1713130, DOI 10.4310/MRL.1999.v6.n3.a3
Iris Anshel, Michael Anshel, and Dorian Goldfeld, Non-abelian key agreement protocols, Discrete Appl. Math. 130 (2003), no. 1, 3–12. The 2000 $\textrm {Com}^2\textrm {MaC}$ Workshop on Cryptography (Pohang). MR 2008401, DOI 10.1016/S0166-218X(02)00585-1
M. Anshel, Braid group cryptography and quantum cryptoanalysis, $8$th Internat. Wigner Symposium (New York, U.S.A., 2003), Baruch College of CUNY, pp. 13–27.
Tom M. Apostol, Modular functions and Dirichlet series in number theory, 2nd ed., Graduate Texts in Mathematics, vol. 41, Springer-Verlag, New York, 1990. MR 1027834, DOI 10.1007/978-1-4612-0999-7
S. Arora and B. Barak, Complexity theory: a modern approach, http://www.cs.princeton.edu/theory/complexity/, 2008.
J. Benaloh, Dense probabilistic encryption, $1$st Annual Workshop on Selected Areas in Cryptology (Queen’s Univ., Kingston, Canada, 1994), Springer-Verlag, London, 1994, pp. 120–128.
Charles H. Bennett and Peter W. Shor, Quantum information theory, IEEE Trans. Inform. Theory 44 (1998), no. 6, 2724–2742. Information theory: 1948–1998. MR 1658902, DOI 10.1109/18.720553
I. F. Blake, G. Seroussi, and N. P. Smart, Elliptic curves in cryptography, London Mathematical Society Lecture Note Series, vol. 265, Cambridge University Press, Cambridge, 2000. Reprint of the 1999 original. MR 1771549
Andreas Blass and Yuri Gurevich, Matrix transformation is complete for the average case, SIAM J. Comput. 24 (1995), no. 1, 3–29. MR 1313476, DOI 10.1137/S0097539792232070
Norbert Blum, A Boolean function requiring $3n$ network size, Theoret. Comput. Sci. 28 (1984), no. 3, 337–345. MR 742295, DOI 10.1016/0304-3975(83)90029-4
A. Bogdanov and L. Trevisan, On worst-case to average-case reductions for NP problems, $44$th Annual IEEE Symposium on Foundations of Computer Science (FOCS’03) (Cambridge, MA, U.S.A., 2003), IEEE Computer Soc., Washington, DC, 2003, pp. 308–317.
Dan Boneh and Ramarathnam Venkatesan, Breaking RSA may not be equivalent to factoring (extended abstract), Advances in cryptology—EUROCRYPT ’98 (Espoo), Lecture Notes in Comput. Sci., vol. 1403, Springer, Berlin, 1998, pp. 59–71. MR 1729052, DOI 10.1007/BFb0054117
D. R. L. Brown, Breaking RSA may be as difficult as factoring, Tech. Rep. 2005/380, Cryptology ePrint Archive, 2005.
Whitfield Diffie and Martin E. Hellman, New directions in cryptography, IEEE Trans. Inform. Theory IT-22 (1976), no. 6, 644–654. MR 437208, DOI 10.1109/tit.1976.1055638
Cynthia Dwork, Positive applications of lattices to cryptography, Mathematical foundations of computer science 1997 (Bratislava), Lecture Notes in Comput. Sci., vol. 1295, Springer, Berlin, 1997, pp. 44–51. MR 1640207, DOI 10.1007/BFb0029948
S. Even and Y. Yacobi, Cryptocomplexity and NP-completeness, Automata, languages and programming (Proc. Seventh Internat. Colloq., Noordwijkerhout, 1980) Lecture Notes in Comput. Sci., vol. 85, Springer, Berlin-New York, 1980, pp. 195–207. MR 589004
Joan Feigenbaum and Michael Merritt (eds.), Distributed computing and cryptography, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 2, American Mathematical Society, Providence, RI; Association for Computing Machinery (ACM), New York, 1991. MR 1105537, DOI 10.1090/dimacs/002
Michael Fellows and Neal Koblitz, Combinatorial cryptosystems galore!, Finite fields: theory, applications, and algorithms (Las Vegas, NV, 1993) Contemp. Math., vol. 168, Amer. Math. Soc., Providence, RI, 1994, pp. 51–61. MR 1291417, DOI 10.1090/conm/168/01688
O. Goldreich, Introduction to complexity theory, Lecture notes, Weizmann Inst. Sci., 1998–1999.
S. Goldwasser and M. Bellare, Lecture notes on cryptography, Summer course on cryptography at MIT, 2001.
Shafi Goldwasser and Silvio Micali, Probabilistic encryption, J. Comput. System Sci. 28 (1984), no. 2, 270–299. MR 760548, DOI 10.1016/0022-0000(84)90070-9
D. Grigoriev, Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines, Theoret. Comput. Sci. 180 (1997), no. 1-2, 217–228. MR 1453867, DOI 10.1016/S0304-3975(96)00188-0
D. Yu. Grigor′ev, Public-key cryptography and invariant theory, Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 293 (2002), no. Teor. Slozhn. Vychisl. 7, 26–38, 181 (Russian, with English and Russian summaries); English transl., J. Math. Sci. (N.Y.) 126 (2005), no. 3, 1152–1157. MR 1948823, DOI 10.1007/s10958-005-0068-4
Dima Grigoriev, Edward A. Hirsch, and Konstantin Pervyshev, A complete public-key cryptosystem, Groups Complex. Cryptol. 1 (2009), no. 1, 1–12. MR 2502933, DOI 10.1515/GCC.2009.1
D. Grigoriev, A. Kojevnikov, and S. I. Nikolenko, Invariant-based cryptosystems and their security against provable break, Tech. Rep. 158, Max-Planck-Inst. Preprints, 2007.
Dima Grigoriev and Ilia Ponomarenko, Homomorphic public-key cryptosystems over groups and rings, Complexity of computations and proofs, Quad. Mat., vol. 13, Dept. Math., Seconda Univ. Napoli, Caserta, 2004, pp. 305–325. MR 2131411
D. Yu. Grigor′ev and I. N. Ponomarenko, On nonabelian homomorphic public-key cryptosystems, Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 293 (2002), no. Teor. Slozhn. Vychisl. 7, 39–58, 181–182 (Russian, with English and Russian summaries); English transl., J. Math. Sci. (N.Y.) 126 (2005), no. 3, 1158–1166. MR 1948824, DOI 10.1007/s10958-005-0077-3
Dima Grigoriev and Ilia Ponomarenko, Homomorphic public-key cryptosystems and encrypting Boolean circuits, Appl. Algebra Engrg. Comm. Comput. 17 (2006), no. 3-4, 239–255. MR 2233784, DOI 10.1007/s00200-006-0005-x
Dima Grigoriev and Ilia Ponomarenko, Constructions in public-key cryptography over matrix groups, Algebraic methods in cryptography, Contemp. Math., vol. 418, Amer. Math. Soc., Providence, RI, 2006, pp. 103–119. MR 2389292, DOI 10.1090/conm/418/07949
Darrel Hankerson, Alfred Menezes, and Scott Vanstone, Guide to elliptic curve cryptography, Springer Professional Computing, Springer-Verlag, New York, 2004. MR 2054891, DOI 10.1016/s0012-365x(04)00102-5
Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, and Alon Rosen, On robust combiners for oblivious transfer and other primitives, Advances in cryptology—EUROCRYPT 2005, Lecture Notes in Comput. Sci., vol. 3494, Springer, Berlin, 2005, pp. 96–113. MR 2352183, DOI 10.1007/11426639_{6}
Alain P. L. Hiltgen, Constructions of feebly-one-way families of permutations, Advances in cryptology—AUSCRYPT ’92 (Gold Coast, 1992) Lecture Notes in Comput. Sci., vol. 718, Springer, Berlin, 1993, pp. 422–434. MR 1292706, DOI 10.1007/3-540-57220-1_{8}0
Alain P. Hiltgen, Towards a better understanding of one-wayness: facing linear permutations, Advances in cryptology—EUROCRYPT ’98 (Espoo), Lecture Notes in Comput. Sci., vol. 1403, Springer, Berlin, 1998, pp. 319–333. MR 1729060, DOI 10.1007/BFb0054136
E. A. Hirsch and S. I. Nikolenko, A feebly trapdoor function, PDMI Preprints no. 16/2008, S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI), St. Petersburg, 2008.
Neal Koblitz, Elliptic curve cryptosystems, Math. Comp. 48 (1987), no. 177, 203–209. MR 866109, DOI 10.1090/S0025-5718-1987-0866109-5
A. Kojevnikov and S. I. Nikolenko, New combinatorial complete one-way functions, $25^{\text {th}}$ Symposium on Theoretical Aspects of Computer Science (STACS’08) (Bordeaux, February 2008), Bordeaux, 2008.
A. Lempel, Cryptography in transition, Comput. Surveys 11 (1979), no. 4, 215–220.
L. A. Levin, One way functions and pseudorandom generators, Combinatorica 7 (1987), no. 4, 357–363. MR 931193, DOI 10.1007/BF02579323
L. A. Levin, One-way functions, Problemy Peredachi Informatsii 39 (2003), no. 1, 103–117 (Russian, with Russian summary); English transl., Probl. Inf. Transm. 39 (2003), no. 1, 92–103. MR 2101668, DOI 10.1023/A:1023634616182
Hoi-Kwong Lo, Sandu Popescu, and Tim Spiller (eds.), Introduction to quantum computation and information, World Scientific Publishing Co., Inc., River Edge, NJ, 1998. MR 1750536, DOI 10.1142/9789812385253
Eugene M. Luks, Permutation groups and polynomial-time computation, Groups and computation (New Brunswick, NJ, 1991) DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 11, Amer. Math. Soc., Providence, RI, 1993, pp. 139–175. MR 1235801, DOI 10.1090/dimacs/011/11
Le Van Ly, Polly Two: a new algebraic polynomial-based public-key scheme, Appl. Algebra Engrg. Comm. Comput. 17 (2006), no. 3-4, 267–283. MR 2233786, DOI 10.1007/s00200-006-0010-0
Victor S. Miller, Use of elliptic curves in cryptography, Advances in cryptology—CRYPTO ’85 (Santa Barbara, Calif., 1985) Lecture Notes in Comput. Sci., vol. 218, Springer, Berlin, 1986, pp. 417–426. MR 851432, DOI 10.1007/3-540-39799-X_{3}1
Alexei Myasnikov, Vladimir Shpilrain, and Alexander Ushakov, Group-based cryptography, Advanced Courses in Mathematics. CRM Barcelona, Birkhäuser Verlag, Basel, 2008. MR 2437984
David Naccache and Jacques Stern, A new public-key cryptosystem, Advances in cryptology—EUROCRYPT ’97 (Konstanz), Lecture Notes in Comput. Sci., vol. 1233, Springer, Berlin, 1997, pp. 27–36. MR 1603095, DOI 10.1007/3-540-69053-0_{3}
Michael A. Nielsen and Isaac L. Chuang, Quantum computation and quantum information, Cambridge University Press, Cambridge, 2000. MR 1796805
Tatsuaki Okamoto and Shigenori Uchiyama, A new public-key cryptosystem as secure as factoring, Advances in cryptology—EUROCRYPT ’98 (Espoo), Lecture Notes in Comput. Sci., vol. 1403, Springer, Berlin, 1998, pp. 308–318. MR 1729059, DOI 10.1007/BFb0054135
D. K. Rappe, Algebraisch homomorphe Kryptosysteme, Diplomarbeit, Dem Fachbereich Mathematik der Universitat Dortmund, 2000.
Oded Regev, On lattices, learning with errors, random linear codes, and cryptography, STOC’05: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, ACM, New York, 2005, pp. 84–93. MR 2181605, DOI 10.1145/1060590.1060603
Oded Regev, Lattice-based cryptography, Advances in cryptology—CRYPTO 2006, Lecture Notes in Comput. Sci., vol. 4117, Springer, Berlin, 2006, pp. 131–141. MR 2422159, DOI 10.1007/11818175_{8}
R. L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Comm. ACM 21 (1978), no. 2, 120–126. MR 700103, DOI 10.1145/359340.359342
R. L. Rivest and B. Kaliski, RSA problem, Encyclopedia of Cryptography and Security, Kluwer Publ. House, 2005.
Peter W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput. 26 (1997), no. 5, 1484–1509. MR 1471990, DOI 10.1137/S0097539795293172
Larry Smith, Polynomial invariants of finite groups, Research Notes in Mathematics, vol. 6, A K Peters, Ltd., Wellesley, MA, 1995. MR 1328644
R. Venkatesan and S. Rajagopalan, Average case intractability of matrix and diophantine problems, STOC’92: $24$th Annual ACM Symposium on Theory of Computing (Victoria, British Columbia, Canada, May 1992), ACM, New York, 1992, pp. 632–642.
Lawrence C. Washington, Elliptic curves, Discrete Mathematics and its Applications (Boca Raton), Chapman & Hall/CRC, Boca Raton, FL, 2003. Number theory and cryptography. MR 1989729
Ingo Wegener, The complexity of Boolean functions, Wiley-Teubner Series in Computer Science, John Wiley & Sons, Ltd., Chichester; B. G. Teubner, Stuttgart, 1987. MR 905473
A. Yao, How to generate and exchange secrets, $27$th IEEE Symposium on the Foundations of Computer Science (FOCS’$86$) (Toronto, Canada, October 1986), IEEE Computer Society, 1986, pp. 162–187.