Jason A. Donenfeld, marubucin VPN WireGuard, ya ba da shawarar sabunta aiwatar da janareta na lambar bazuwar RDRAND da ke da alhakin aiwatar da na'urorin /dev/random da /dev/urandom a cikin Linux kernel. A ƙarshen Nuwamba, an haɗa Jason a cikin adadin masu kula da direban bazuwar kuma yanzu ya buga sakamakon farko na aikinsa akan sarrafa shi.
Sabuwar aiwatarwa sananne ne don sauyawa zuwa amfani da aikin hash na BLAKE2s maimakon SHA1 don ayyukan haɗin gwiwar entropy. Canjin ya inganta tsaro na janareta na lambar bazuwar ta hanyar kawar da matsala ta SHA1 algorithm da kuma kawar da sake rubutawa na farkon RNG. Tun da BLAKE2s algorithm ya fi SHA1 a cikin aiki, amfani da shi kuma yana da tasiri mai kyau akan aikin janareta na lambar bazuwar (gwaji akan tsarin tare da na'ura mai sarrafa Intel i7-11850H ya nuna karuwar 131% cikin sauri). Wani fa'idar canja wurin hada-hadar entropy zuwa BLAKE2 shine haɗewar algorithms da aka yi amfani da su - BLAKE2 ana amfani da shi a cikin ChaCha cipher, an riga an yi amfani da shi don cire jerin bazuwar.
Bugu da ƙari, an inganta CRNG mai samar da lambar bazuwar ƙira mai aminci da aka yi amfani da shi a cikin kira na getrandom. Haɓakawa suna tafasa ƙasa don iyakance kira zuwa jinkirin janareta na RDRAND lokacin fitar da entropy, wanda ke haɓaka aiki ta sau 3.7. Jason ya nuna cewa kiran RDRAND yana da ma'ana ne kawai a cikin yanayin da CRNG ba a riga an fara shi ba, amma idan ƙaddamar da CRNG ya cika, ƙimarsa ba ta shafar ingancin jerin da aka samar kuma a wannan yanayin kiran zuwa RDRAND. za a iya bayarwa.
An tsara canje-canjen don haɗawa a cikin kernel na 5.17 kuma masu haɓakawa Ted Ts'o (mai kula da direban bazuwar na biyu), Greg Kroah-Hartman (wanda ke da alhakin kiyaye tsayayyen reshe na kernel na Linux) da Jean-Philippe Aumasson (marubucin BLAKE2/3 algorithms).
source: budenet.ru