About Me

Hello, I am Bowen, a Software Engineering student at the University of Waterloo. I enjoy to solve ambitious and challenging problems. I am currently seeking intership opportunity for summer 2025--let's connect!

  • Programing Languages
    C, Python, Java, JavaScript, HTML, CSS, Latex
  • IDE
    VS Code, Vim, PyCharm, Intellij
  • Version Control
    Git, GitHub, GitLab
  • 2023 - present
    Peer/Alumni Tutor for Calculus, Mordern Physic
  • 2024 - present
    Grader for Calculus, Programing in Science
  • University of Waterloo
    Bachelor of Apllied Science, Software Engineering
  • Marianopolis College
    Diploma of College Study, Health Science

My Projects

Automatic Chess Board

An autonomous robotic chessboard allows human to play against Stocketfish chess engine on a physical chessboard. The chessboard employs Hall effect sensor matrix to detect magnetic chess pieces. The chessboard detects and communicates player's movement to a server running the Stockfish chess engine in real-time via WebSockets. According to Stockfish's move, the pieces are dragged by the magnet beath the board using CoreXy system.

Video demo Source Code Project report

Online portfolio

A responsive website to display my projects. Created with HTML, CSS and JavaScript.

Source Code

RSA

Implement RSA encryption system using Python to allow user to encrypt and decrypt their message as well as generating a pair of public and private keys according to the user's need.

Source Code

Tetris

A tetris game for windows

Source Code Download to play

Securing Digital Communication in the Post Quantum Era

The report highlights the vulnerability of current cryptographic systems (e.g., RSA, ECC) to quantum computing advancements, which can solve critical mathematical problems like prime factorization and discrete logarithms. It evaluates quantum-resistant encryption algorithms, including Learning with Errors, Nth-degree Truncated Polynomial Ring Units, McEliece, and Advanced Encryption Standard.

Read the full report

Limitation of RSA: Wiener's Attack

A research on the Wiener's Attack which can efficitly recover the private key of RSA if the private key , d is smaller than m 1 4 3 where m is modulus in RSA.

See the slides