Package manager: npm
Affected module: bson-ext
GitHub repo: mongodb-js/bson-ext
Module description:
Package manager: npm
Affected module: bson-ext
GitHub repo: mongodb-js/bson-ext
Module description:
Assigned CVE: CVE-2024-5629
Snyk advisory: SNYK-PYTHON-PYMONGO-7172112
GitHub advisory: GHSA-m87m-mmvp-v9qm
GitHub commit: PYTHON-4305 Fix bson size check (#1564)
Assigned CVE: CVE-2024-21502
Snyk advisory: SNYK-PYTHON-FASTECDSA-6262045
GitHub commit: fix memory corruption issue
Package manager: pip
Here is the solution to problem 61 from The Cryptopals Crypto Challenges. Challenge descriptions from Set 8 have never been officially published. However, a description for problem 61 can be found here: https://toadstyle.org/cryptopals/61.txt.
In short, let's say we have a pair (message, signature)
for some digital-signature scheme (DSA, ECDSA, RSA, etc). We need to construct valid scheme parameters and signer's public key, so that the signature can be successfully verified with these parameters.
I've implemented this algorithm for DSA, ECDSA and RSA.
Я добавил несколько проверок в код, чтобы усилить безопасность сайта. Надеюсь, что теперь мой сайт полностью безопасен. Если вы обойдёте защиту, сможете получить флаг в директории /tmp/. Не думаю, что у вас получится.
Флаг: LetoCTF{sSt1_1n_ejs_sT1ll_w0rk5_iN_2020}
#!/usr/bin/env sage | |
# François Arnault. 1995. Constructing Carmichael Numbers which are Strong Pseudoprimes to Several Bases | |
# https://doi.org/10.1006/jsco.1995.1042 | |
from sys import stderr | |
from random import choice, getrandbits | |