MinReduct: a new algorithm for computing the shortest reducts

•A new algorithm for computing all the shortest reducts of a decision system is introduced.•Some of the most effective pruning properties for computing all reducts are adapted to compute only the shortest reducts.•Our algorithm uses binary cumulative operations and a fast candidate evaluation process unlike other algorithms.•Our proposal is the fastest in decision systems whose simplified binary discernibility matrices have medium or high density.