The field of cryptography is moving towards developing secure algorithms against quantum computer attacks. Researchers are exploring new approaches to improve the efficiency and security of cryptographic algorithms, including the use of parallel scalar point multiplication and matrix decomposition methods. Additionally, there is a growing interest in post-quantum cryptography, with a focus on evaluating the performance of leading algorithms such as Kyber, sntrup761, and FrodoKEM. Quantum computing is also being applied to solve complex problems, including prime factorization, with novel approaches being developed to improve the computational complexity of factoring. Noteworthy papers include: A Classical Quadratic Speedup for Planted $k$XOR, which presents a new classical algorithm that is quadratically faster than the best previous one, and Quantum Prime Factorization: A Novel Approach Based on Fermat Method, which introduces a new improvement to the classical Fermat method and reformulates it as an optimization problem suitable for Quantum Annealers.