PacketMania

RSA: Attack and Defense (II)

2026-07-24T01:01:52.175Z

This article first supplements two specific integer factorization methods - Fermat’s factorization method and Pollard’s rho algorithm, explaining the essence of their algorithms and applicable scenarios, and provides a Python reference implementation. Next, it analyzes in detail a classic low private exponent attack - Wiener’s attack, elaborating on the mathematical basis, the attack principle, and the attack procedure, with a complete Python program. The article also cites the latest research paper proposing a new upper bound for the private exponent when Wiener’s attack is successful and verifies the correctness of this limit with a test case.

LeetCode 75 Study Plan Checklist and Solutions

2025-09-27T17:11:08.000Z

LeetCode 75 study plan selects 75 classic algorithm problems, covering strings, arrays, hashing, two pointers, linked lists, trees, graphs, and dynamic programming. It not only helps beginners quickly master commonly used algorithms and data structures, but also enables experienced programmers to review and fill in gaps systematically. Here we provide a full progress checklist and reference solutions for all 75 problems.

Harvard CS50AI Introduction - Learning Artificial Intelligence from Scratch

2025-02-23T01:05:26.000Z

Harvard’s CS50AI is an open online course that introduces the fundamentals of artificial intelligence using Python for programming and hands-on project-based learning. The course is created and taught by Harvard Professor David J. Malan and his team and is part of the popular CS50 computer science series, suitable for learners with some programming experience.

Purdue MA 26500 Spring 2022 Final Exam Solutions

2024-04-19T06:51:21.000Z

Here comes the solution and analysis for Purdue MA 26500 Spring 2022 Final exam. This exam covers all topics from Chapter 1 (Linear Equations in Linear Algebra) to Chapter 7 Section 1 (Diagonalization of Symmetric Matrices).

Purdue CS24000 Fall 2018 Midterm II Solutions

2024-03-28T04:47:01.000Z

Purdue University CS24000 is an undergraduate-level course that teaches students programming principles and techniques for problem-solving in the C programming language. Here are the solution and study notes for the Fall 2018 Midterm 2 exam.

Programming in C Exam Review and Practices (II)

2024-03-27T05:47:48.000Z

Here is a series of general study guides to college-level C programming courses. This is the second part covering dynamic memory allocation, advanced pointer operations, recursion, linked list and tree common functions, etc.

Purdue CS24000 2022 Summer Final Exam Solutions

2024-03-25T02:04:07.000Z

Purdue MA 26500 Spring 2022 Midterm II Solutions

2024-03-01T07:41:24.000Z

Here comes the solution and analysis for Purdue MA 26500 Spring 2022 Midterm II. This second midterm covers topics in Chapter 4 (Vector Spaces) and Chapter 5 (Eigenvalues and Eigenvectors) of the textbook.

Purdue MA 26500 Spring 2023 Midterm II Solutions

2024-03-01T07:21:56.000Z

Here comes the solution and analysis for Purdue MA 26500 Spring 2023 Midterm II. This second midterm covers topics in Chapter 4 (Vector Spaces) and Chapter 5 (Eigenvalues and Eigenvectors) of the textbook.

Programming in C Exam Review and Practices (I)

2024-02-29T07:10:00.000Z

Here is a series of general study guides to college-level C programming courses. This is the first part covering compilation and linking, file operations, typedef, structures, string operations, basic pointer operations, etc.

Purdue CS24000 2022 and 2023 Summer Midterm Exam Solutions

2024-02-26T00:16:50.000Z

Purdue CS24000 Fall 2018 Midterm I Solutions

2024-02-25T06:41:38.000Z

Purdue MA 26500 Fall 2022 Midterm II Solutions

2024-02-11T06:44:07.000Z

Here comes the solution and analysis for Purdue MA 26500 Fall 2022 Midterm II. This second midterm covers topics in Chapter 4 (Vector Spaces) and Chapter 5 (Eigenvalues and Eigenvectors) of the textbook.

Purdue MA 26500 Fall 2023 Midterm I Solutions

2024-01-29T04:18:14.000Z

This is the 3rd study notes post for the college linear algebra course. Here is the review of Purdue MA 26500 Fall 2023 midterm I. I provide solutions to all exam questions as well as concise explanations.

Purdue MA 26500 Spring 2023 Midterm I Solutions

2024-01-23T19:04:43.000Z

This is the 2nd study notes post for the college linear algebra course. Here is the review of Purdue MA 26500 Spring 2023 midterm I. I provide solutions to all exam questions as well as concise explanations.

Purdue MA 26500 Fall 2022 Midterm I Solutions

2024-01-20T06:55:57.000Z

Linear algebra provides mathematical tools to represent and analyze data and models in higher dimensions. It is essential for machine learning, computer graphics, control theory, and other scientific and engineering fields. Starting from this post, I will provide study guides and solutions to Purdue MA26500 exams in the last few semesters.

The Inductive Proof and Applications of Fermat's Little Theorem

2023-11-15T07:52:56.000Z

In the history of mathematics, Pierre de Fermat was a special figure. His formal occupation was as a lawyer, but he was exceptionally fond of mathematics. Although an amateur, Fermat’s achievements in mathematics were no less than those of professional mathematicians of the same era. He contributed to modern calculus, analytic geometry, probability, and number theory. Especially in the field of number theory, Fermat was most interested and achieved the most outstanding results.

TLS 1.3 and the Coming NIST Mandate

2023-08-22T02:50:26.000Z

TLS (Transport Layer Security) is a cryptographic protocol to secure network communication. TLS 1.3 is the latest version of the TLS protocol, succeeding TLS 1.2. TLS 1.3 aims to provide more robust security, higher privacy protection, and better performance than previous versions. Here is a brief introduction to TLS 1.3. Also, we discuss NIST’s requirement for TLS 1.3 readiness and give examples of enabling TLS 1.3 in some commonly used web servers.

RSA: Attack and Defense (I)

2023-03-17T04:00:32.000Z

RSA is a public-key cryptosystem built on top of an asymmetric encryption algorithm, which was jointly invented by three cryptographers and computer scientists at the Massachusetts Institute of Technology in 1977. The RSA public-key encryption algorithm and cryptosystem provide data confidentiality and signature verification functions widely used on the Internet. Since its birth, RSA has become a major research object of modern cryptography. Many cryptanalysts and information security experts have been studying its possible theoretical flaws and technical loopholes to ensure security and reliability in practical applications.

Notes on Using uClibc Standard Library in Embedded Linux System

2023-03-11T07:38:37.000Z

uClibc is a small and exquisite C standard library for embedded Linux systems. It is widely used in the development of low-end embedded systems and Internet of Things devices. Here are some recent experiences to provide convenience for engineers who need to solve similar problems or meet corresponding requirements.