The field of cryptography and coding theory is rapidly advancing, with a focus on developing secure and efficient methods for protecting sensitive information. Recent research has led to the development of new public-key cryptography algorithms, such as those based on satisfiability problems and skew polynomial evaluation, which offer improved security and efficiency. Additionally, there have been significant advances in the analysis of pseudocodewords in low-density parity-check codes, which has implications for the development of robust and scalable coding schemes. The use of machine learning and SAT solving techniques has also become increasingly prevalent in the field, allowing for the efficient analysis and optimization of complex cryptographic systems. Furthermore, research on the lonely runner conjecture and the bottleneck birthday problem has led to new insights into the properties of random matrices and the behavior of complex systems. Notable papers in this area include the introduction of the Primitive Vector Cipher, a novel hybrid encryption scheme, and the cryptanalysis of Gleeok-128, a low latency keyed pseudorandom function. The proposed scheme and the cryptanalysis provide new insights into the security and efficiency of cryptographic systems.