Results 11 to 20 of about 209 (93)
De héroes y encrucijadas: el bivium, motivo ideológico y estructurador de las narraciones caballerescas espirituales del Siglo de Oro [PDF]
Se analiza, a partir de la tradición literaria e iconográfica anterior, uno de los motivos más recurrentes de las narraciones caballerescas espirituales del Siglo de Oro: el del bivium o camino que se bifurca, que sirve de hilo conductor de la aventura llevando al protagonista, cual Hércules prodicus, tras la siempre difícil elección, por el camino ...
Herrán Alonso, Emma
openaire +3 more sources
AIDA Breaks BIVIUM (A&B) in 1 Minute Dual Core CPU Time. [PDF]
The stream cipher BIVIUM (both BIVIUM-A and BIVIUM-B), a modification of the eSTREAM finalist TRIVIUM, can be broken completely by the Algebraic IV Differential Attack, AIDA, using $2^{27.5}$ simulations or one minute of dual core processing.
Michael Vielhaber
core +3 more sources
Attacking Bivium Using SAT Solvers
In this paper we present experimental results of an application of SAT solvers in current cryptography. Trivium is a very promising stream cipher candidate in the final phase of the eSTREAM project. We use the fastest industrial SAT solvers to attack a reduced version of Trivium - called Bivium.
Tobias Eibach +2 more
openaire +3 more sources
Оценки стойкости шифров семейства Trivium к криптоанализу на основе алгоритмов решения проблемы булевой выполнимости [PDF]
Представлены результаты криптоанализа трёх поточных шифров семейства Trivium (Bivium, Trivium toy, Bivium toy). Криптоанализ осуществляется за счёт сведения обращения соответствующих дискретных функций к задаче о булевой выполнимости (SAT).
Отпущенников, Илья Владимирович +2 more
core +2 more sources
Cryptanalysis of Bivium using a Boolean all solution solver [PDF]
Cryptanalysis of Bivium is presented with the help of a new Boolean system solver algorithm. This algorithm uses a Boolean equation model of Bivium for a known keystream.
Virendra Sule, Anmol Yadav
core +1 more source
In this paper, a SAT-based cryptanalysis of the Bivium stream cipher is considered. For encoding the initial cryptanalysis problem into SAT a special program Transalg was used. For an obtained SAT instance we use Monte Carlo method to search for a partitioning with good time estimation.
Oleg Zaikin +2 more
openaire +2 more sources
Accelerating First-Order Secure ML-KEM With Masked SHA-3: Cost, Randomness, and Security Evaluation
Hash functions are fundamental for ensuring authenticity and integrity in digital communications. Their importance has grown with the advent of Post-Quantum Cryptography (PQC), as many newly standardized PQC algorithms, such as ML-KEM, heavily rely on ...
Stefano Di Matteo +5 more
doaj +1 more source
Formal Verification, Integration and Physical Evaluation of Prime-Field Masking on Silicon
The resistance of provably secure masked circuits to physical attacks depends in part on the underlying algebraic group and recombination function. Masking over finite fields of odd prime order has been demonstrated, both in theory and in practice, to ...
Gaëtan Cassiers +4 more
doaj +1 more source
The Bivium Syndrome in the History of Semiotics
Recent interest in the history of semiotics has begun to generate some concern for the theoretical framework housing the development of the discipline in relation to thinkers who have been pondering the nature and function of the sign in Western scholarship (e.g., Jakobson 1975; Sebeok 1977:149-188).
openaire +2 more sources
Algebraic analysis of Trivium-like ciphers [PDF]
Trivium is a bit-based stream cipher in the final portfolio of the eSTREAM project. In this paper, we apply the approach of Berbain et al. to Trivium-like ciphers and perform new algebraic analyses on them, namely Trivium and its reduced versions ...
Kenneth Koon-Ho Wong +4 more
core +3 more sources

