Skip to search formSkip to main contentSkip to account menu

Block Wiedemann algorithm

The block Wiedemann algorithm for computing kernel vectors of a matrix over a finite field is a generalisation of an algorithm due to Don Coppersmith… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
Overview. Computing the Gröbner basis of an ideal with respect to a term ordering is an essential step in solving systems of… 
2017
2017
Public key cryptography is based on mathematically hard problems namely integer factorization and Discrete Logarithm Problem (DLP… 
2016
2016
Solving large-scale sparse linear systems over GF(2) plays a key role in fluid mechanics, simulation and design of materials… 
2015
2015
− evaluation, space complexity Abstract. The general number sieve is the most efficient algorithm known integer factorization, it… 
2011
2011
The discrete logarithm problem over finite fields serves as th e source of security for several cryptographic primitives. The… 
2011
2011
Metabolische Erkrankungen sind ein Hauptfaktor fur die Entstehung von Atherosklerose und das damit einhergehende Risiko fur das… 
2010
2010
Beckwith-Wiedemann sendromu (BWS), makrosomi, makroglossi, karin duvar defektleri, hemihipertrofi ile karakterize prenatal veya… 
Review
2008
Review
2008
The purpose of this project was to take a closer look at the use of technology during literacy instruction. We sought to examine… 
2007
2007
Recently, balanced 15-variable Boolean functions w ith nonlinearity 16266 were obtained by suitably modifying unbalanced Patt…