Scholarlink

This chapter is structured into two sections to facilitate the transition from computational complexity to cryptography. First, we revisit key concepts in computational complexity in order to put forward the most important term “probabilistic polynomial-time algorithms”. Next, we explore cryptography, introducing principles that guide the definitions for usability and security. These explanations aim to clarify the concept of probabilistic polynomial-time algorithms and their role in cryptographic definitions.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

From Computational Complexity to Cryptography: Transition

  • 章节

  • 发表日期：

    2025年

查看全文
  • Fuchun Guo,
  • Willy Susilo,
  • Khoa Nguyen,
  • Xiaofeng Chen,
  • Zhen Zhao

摘要

This chapter is structured into two sections to facilitate the transition from computational complexity to cryptography. First, we revisit key concepts in computational complexity in order to put forward the most important term “probabilistic polynomial-time algorithms”. Next, we explore cryptography, introducing principles that guide the definitions for usability and security. These explanations aim to clarify the concept of probabilistic polynomial-time algorithms and their role in cryptographic definitions.