Document Open Access Logo

How to Covertly and Uniformly Scramble the 15 Puzzle and Rubik’s Cube

Authors Kazumasa Shinagawa , Kazuki Kanai , Kengo Miyamoto , Koji Nuida

PDF
Thumbnail PDF

File

LIPIcs.FUN.2024.30.pdf
  • Filesize: 2.41 MB
  • 15 pages

Document Identifiers

Author Details

Kazumasa Shinagawa
  • Ibaraki University, Japan
  • National Institute of Advanced Industrial Science and Technology (AIST), Tokyo, Japan
Kazuki Kanai
  • National Institute of Technology, Kure College, Hiroshima, Japan
Kengo Miyamoto
  • Ibaraki University, Japan
Koji Nuida
  • Institute of Mathematics for Industry (IMI), Kyushu University, Fukuoka, Japan
  • National Institute of Advanced Industrial Science and Technology (AIST), Tokyo, Japan

Funding

  • Shinagawa, Kazumasa: This work was supported in part by JSPS KAKENHI Grant Numbers 21K17702 and 23H00479, and JST CREST Grant Number MJCR22M1.
  • Miyamoto, Kengo: This work was supported in part by JSPS KAKENHI Grant Numbers 20K14302 and 23H00479.
  • Nuida, Koji: This work was supported in part by JSPS KAKENHI Grant Number JP19H01109.

Cite AsGet BibTex

Kazumasa Shinagawa, Kazuki Kanai, Kengo Miyamoto, and Koji Nuida. How to Covertly and Uniformly Scramble the 15 Puzzle and Rubik’s Cube. In 12th International Conference on Fun with Algorithms (FUN 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 291, pp. 30:1-30:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.FUN.2024.30

Abstract

A combination puzzle is a puzzle consisting of a set of pieces that can be rearranged into various combinations, such as the 15 Puzzle and Rubik’s Cube. Suppose a speedsolving competition for a combination puzzle is to be held. To make the competition fair, we need to generate an instance (i.e., a state having a solution) that is chosen uniformly at random and unknown to anyone. We call this problem a secure random instance generation of the puzzle. In this paper, we construct secure random instance generation protocols for the 15 Puzzle and for Rubik’s Cube. Our method is based on uniform cyclic group factorizations for finite groups, which is recently introduced by the same authors, applied to permutation groups for the puzzle instances. Specifically, our protocols require 19 shuffles for the 15 Puzzle and 43 shuffles for Rubik’s Cube.

Subject Classification

ACM Subject Classification
  • Security and privacy → Information-theoretic techniques
Keywords
  • Card-based cryptography
  • Uniform cyclic group factorization
  • Secure random instance generation
  • The 15 Puzzle
  • Rubik’s Cube

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Adrian Brüngger, Ambros Marzetta, K. Fukuda, and Jürg Nievergelt. The parallel search bench ZRAM and its applications. Ann. Oper. Res., 90:45-63, 1999. Google Scholar
  2. Yang Chu and Robert Hough. Solution of the 15 puzzle problem, 2019. URL: https://arxiv.org/abs/1908.07106.
  3. Claude Crépeau and Joe Kilian. Discreet solitary games. In Advances in Cryptology - CRYPTO' 93, volume 773 of LNCS, pages 319-330. Springer, 1994. Google Scholar
  4. Erik D. Demaine, Sarah Eisenstat, and Mikhail Rudoy. Solving the rubik’s cube optimally is NP-complete. In 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, volume 96 of LIPIcs, pages 24:1-24:13, 2018. Google Scholar
  5. Bert Den Boer. More efficient match-making and satisfiability the five card trick. In EUROCRYPT 1989, volume 434 of LNCS, pages 208-217. Springer, 1990. Google Scholar
  6. Yuji Hashimoto, Koji Nuida, Kazumasa Shinagawa, Masaki Inamura, and Goichiro Hanaoka. Toward finite-runtime card-based protocol for generating a hidden random permutation without fixed points. IEICE Trans. Fundam., E101.A(9):1503-1511, 2018. Google Scholar
  7. Yuji Hashimoto, Kazumasa Shinagawa, Koji Nuida, Masaki Inamura, and Goichiro Hanaoka. Secure grouping protocol using a deck of cards. In Information Theoretic Security, volume 10681 of LNCS, pages 135-152. Springer, 2017. Google Scholar
  8. Takuya Ibaraki and Yoshifumi Manabe. A more efficient card-based protocol for generating a random permutation without fixed points. In Mathematics and Computers in Sciences and in Industry (MCSI), pages 252-257, 2016. Google Scholar
  9. Rie Ishikawa, Eikoh Chida, and Takaaki Mizuki. Efficient card-based protocols for generating a hidden random permutation without fixed points. In Unconventional Computation and Natural Computation, volume 9252 of LNCS, pages 215-226. Springer, 2015. Google Scholar
  10. Kazuki Kanai, Kengo Miyamoto, Koji Nuida, and Kazumasa Shinagawa. Uniform cyclic group factorizations of finite groups. Communications in Algebra, 2023. Google Scholar
  11. Alexander Koch and Stefan Walzer. Foundations for actively secure card-based cryptography. In Fun with Algorithms, volume 157 of LIPIcs, pages 17:1-17:23, 2020. Google Scholar
  12. Kengo Miyamoto and Kazumasa Shinagawa. Graph automorphism shuffles from pile-scramble shuffles. New Gener. Comput., 40:199-223, 2022. Google Scholar
  13. Takaaki Mizuki, Yoshinori Kugimoto, and Hideaki Sone. Secure multiparty computations using the 15 puzzle. In Combinatorial Optimization and Applications, volume 4616 of LNCS, pages 255-266. Springer, 2007. Google Scholar
  14. Takaaki Mizuki and Hiroki Shizuya. A formalization of card-based cryptographic protocols via abstract machine. Int. J. Inf. Secur., 13(1):15-23, 2014. Google Scholar
  15. Takaaki Mizuki and Hideaki Sone. Six-card secure AND and four-card secure XOR. In Frontiers in Algorithmics, volume 5598 of LNCS, pages 358-369. Springer, 2009. Google Scholar
  16. Bruce Norskog and Morley Davidson. The fifteen puzzle can be solved in 43 "moves", 2010. URL: http://cubezzz.duckdns.org/drupal/?q=node/view/223.
  17. Daniel Ratner and Manfred K. Warmuth. Finding a shortest solution for the N times N extension of the 15-puzzle is intractable. In Proceedings of the 5th National Conference on Artificial Intelligence. Volume 1: Science, pages 168-172, 1986. Google Scholar
  18. Daniel Ratner and Manfred K. Warmuth. N times N puzzle and related relocation problem. J. Symb. Comput., 10(2):111-138, 1990. Google Scholar
  19. Tomas Rokicki, Palo Alto, Herbert Kociemba, Morley Davidson, and John Dethridge. God’s number is 20. URL: https://www.cube20.org/.
  20. Takahiro Saito, Daiki Miyahara, Yuta Abe, Takaaki Mizuki, and Hiroki Shizuya. How to implement a non-uniform or non-closed shuffle. In Theory and Practice of Natural Computing, volume 12494 of LNCS, pages 107-118. Springer, 2020. Google Scholar
  21. Kazumasa Shinagawa and Kengo Miyamoto. Automorphism shuffles for graphs and hypergraphs and its applications. IEICE Trans. Fundam., E106.A(3):306-314, 2023. Google Scholar
  22. Kazumasa Shinagawa, Takaaki Mizuki, Jacob C. N. Schuldt, Koji Nuida, Naoki Kanayama, Takashi Nishide, Goichiro Hanaoka, and Eiji Okamoto. Multi-party computation with small shuffle complexity using regular polygon cards. In Provable Security, volume 9451 of LNCS, pages 127-146. Springer, 2015. Google Scholar
  23. Itaru Ueda, Daiki Miyahara, Akihiro Nishimura, Yu-ichi Hayashi, Takaaki Mizuki, and Hideaki Sone. Secure implementations of a random bisection cut. Int. J. Inf. Secur., 19(4):445-452, 2020. Google Scholar
  24. Online rubik’s cube solver. URL: https://rubiks-cube-solver.com/.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact