Journal Menu

Special Issues

Table of Content

Security Analysis of a Modulo-2¹⁶ Implementation Variant of the MBRISI Lightweight ARX Block Cipher: Weak Keys, Deterministic Differentials, and Equivalent Keys

Yanjun Li^1,2, Yiping Lin^2,*, Yuting Ni², Lixian Zhang², Shanshan Huo¹
1 Information Industry Information Security Evaluation Center, The 15th Research Institute of China Electronics Technology Group Corporation, Beijing, China
2 Beijing Electronic Science and Technology Institute, Beijing, China
* Corresponding Author: Yiping Lin. Email: email

Computers, Materials & Continua https://doi.org/10.32604/cmc.2026.087189

Received 11 June 2026; Accepted 14 August 2026; Published online 10 September 2026

Download PDF

Abstract

This paper presents an exact security evaluation of a closed modulo-

2^{16}

implementation variant of the lightweight Add–Rotate–XOR (ARX) block cipher named MBRISI. We first resolve an arithmetic ambiguity in the original specification: modulo-65,537 addition on 16-bit words may produce the unrepresentable value 65,536, while representing its outputs by 16-bit overflow is non-injective. We construct distinct plaintext pairs that merge after the first round and consequently produce identical ciphertexts. In contrast, modulo-

2^{16}

addition is closed and bijective over the 16-bit word space; therefore, all subsequent weak-key and equivalent-key results apply exclusively to this implementation variant. We prove that addition by a fixed round key is affine over

G F (2)^{16}

if and only if the key belongs to

{0 x 0000, 0 x 4000, 0 x 8000, 0 x C 000}

, in which case every XOR difference propagates deterministically. Because this set is closed under the MBRISI round-key recurrence, weak initial subkeys make the complete ten-round encryption mapping affine over

G F (2)^{32}

. By modeling the rotation–XOR preprocessing as linear maps, we show that their images equal the even-parity subspace, their kernels have dimension one, and every image element has exactly two complementary preimages. These properties reduce exact weak-key counting and structural identification from

2^{32}

half-key-pair tests to

KeywordsLightweight block cipher; ARX cipher; IoT security; differential cryptanalysis; weak key; deterministic differential; equivalent key; key scheduleDownloads Full-Text PDF Citation Tools BibTex EndNote RIS 114 View 41 Download 0 Like Related articles Novel Scheme for Robust Confusion Component Selection Based on Pythagorean Fuzzy Set Nabilah Abughazalah, Mohsin Iqbal,... Optimal Hybrid Deep Learning Enabled Attack Detection and Classification in IoT Environment Fahad F. Alruwaili Blockchain-Based Decentralized Authentication Model for IoT-Based E-Learning and Educational Environments Osama A. Khashan, Sultan Alamri,... A Novel Approach for Security Enhancement of Data Encryption Standard Dawood Shah, Tariq Shah, Sajjad... Temperature-Triggered Hardware Trojan Based Algebraic Fault Analysis of SKINNY-64-64 Lightweight Block Cipher Lei Zhu, Jinyue Gong, Liang Dong,...Further Information About Tech Science Press Open Access Policy Article Processing Charges Special Issue Policy Generative AI Policies for Journals Terms and Conditions Privacy Policy Advertising Policy Contact Guidelines For Editors For Reviewers For Authors For Conference Organizers For Subscribers Follow Us LinkedIn Twitter Subscribe Join Us Join TSP editorial community Contact Us WhatsApp: +1（702）9272320 Copyright© 2026 Tech Science Press © 1997-2026 TSP (Henderson, USA) unless otherwise statednew WOW().init();

    $(window).scroll(function () {
        var top = $(window).scrollTop();
        var hed = $(".header").innerHeight();
        if (top > hed) {
            $(".header").addClass("on");
        } else {
            $(".header").removeClass("on");
        }
    });

    function showWhatsApp() {
        document.getElementById('whats-app').style.display = 'block';
    }
    function hideWhatsApp() {
        document.getElementById('whats-app').style.display = 'none';
    }
    
    function setTab(name, cursel, n) {
        for (i = 1; i <= n; i++) {
            var menu = document.getElementById(name + i);
            var con = document.getElementById("con_" + name + "_" + i);
            menu.className = i == cursel ? "hover" : "";
            con.style.display = i == cursel ? "block" : "none";
        }
    }window.dataLayer = window.dataLayer || [];
  function gtag(){dataLayer.push(arguments);}
  gtag('js', new Date());

  gtag('config', 'G-PD3QTEE3HW');Home Submit Login RegisterShare Link Copy$(document).ready(function () {
        /*返回顶部*/
        $('#roll_top').hide();
        $(window).scroll(function () {
            if ($(window).scrollTop() > 300) {
                $('#roll_top').fadeIn(400);//当滑动栏向下滑动时，按钮渐现的时间
            } else {
                $('#roll_top').fadeOut(0);//当页面回到顶部第一屏时，按钮渐隐的时间
            }
        });
        $('#roll_top').click(function () {
            $('html,body').animate({
                scrollTop: '0px'
            }, 300);//返回顶部所用的时间 返回顶部也可调用goto()函数
        });
    });
    function goto(selector) {
        $.scrollTo(selector, 1000);
    }

    $(function () {
        var clipboard = new Clipboard('.fz2');

        clipboard.on('success', function (e) {
            console.log(e);
        });

        clipboard.on('error', function (e) {
            console.log(e);
        });
                
        $(".nlf .nbt").click(function () {
            $(this).toggleClass("currentDd").siblings(".nbt").removeClass("currentDd")
            $(this).toggleClass("currentDt").siblings(".nbt").removeClass("currentDt")
            // 修改数字控制速度， slideUp(500)控制卷起速度
            $(this).next(".k2 ul").slideToggle(500).siblings(".k2 ul").slideUp(500),
                    $(this).next(".k2 .news ").slideToggle(500).siblings(".k2 .news ").slideUp(500),
                    $(this).next(".k2 .weizhang ").slideToggle(500).siblings(".k2 .weizhang ").slideUp(500),
                    $(this).next(".k3 .gdg").slideToggle(500).siblings(".k3 .gdg").slideUp(500);
        })
    })var modal = document.getElementById('modal');
   var bgImg = document.getElementById('bgImg');
   var bgImgLink = document.getElementById('bgImgLink');

  function showBgImg(e) {
       modal.style.display = 'block';
       bgImg.src = e.src;
       bgImgLink.href = e.src;
   }

   modal.onclick = function() {
       modal.style.display = 'none';
   }
   
   bgImg.onclick = function() {
       event.stopPropagation();    // 上层加上这行代码，可以阻止点击穿透
   }
   
   function modalClose(){
       modal.style.display = 'none';
   }function req_html(url, data, cb, t, dataType='html') {
        if (t != 'get') {
            t = 'post';
        } else {
            t = 'get'
        }
        //ajax
        $.ajax({
            type: t,
            url: url,
            data: data,
            dataType: dataType,
            success: function (data) {
                return typeof cb == "function" && cb(data)
            }
        });//ajax 提示
    }
        
    /*
    * 实现点赞功能
    * @param    资源id
    * */
    function addStar(id){
        var num =  $('#star_'+id).html();
        var cookieKey = "star_" + id
        var star=getCookieById(cookieKey,1);
        if(star==""){
            addCookieById(cookieKey,1,365);
            //后台点赞操作
            req_html( 'https://www.techscience.com/tg/home/journal/addOnlineStar',{id: id, num: num}, function (data) {
                console.log(data);
                console.log('#star_'+id);
                $('#star_'+id).html(data.data)
            }, 'get','json')
        }else{
            alert("Already “LIKED” it! Thanks for loving this article!");
        }
    }
    
    /*
    * 获取特定cookie的值
    * @param    cookie键
    * @return   cookie该键对应的值
    * */
    function getCookie(cname){
        var name=cname+"=";
        var ca=document.cookie.split(';');
        for(var i=0;i<ca.length;i++){
            var c=ca[i].trim();
            if(c.indexOf(name)==0)
                return c.substring(name.length,c.length);
        }
        return "";
    }

    /*
    * 判断cookie键中是否有某个资源的id
    * @param    cookie键
    * @param    查询资源id
    * @return   存在返回true，否则返回""
    * */
    function getCookieById(cname,id){
        var name=cname+"=";
        var ca=document.cookie.split(';');
        var cValue="";
        for(var i=0;i<ca.length;i++){
            var c=ca[i].trim();
            if(c.indexOf(name)==0)
                cValue=c.substring(name.length,c.length);
        }
        if(cValue!=""){
            var cArray=cValue.split(",");
            for(var i=0;i<cArray.length;i++){
                var c=cArray[i].trim();
                if(c.indexOf(id)==0){
                    return true;
                }
            }
        }
        return "";
    }


    /*
    * 添加某个资源id到cookie键中
    * @param    cookie键名
    * @param    资源id
    * @param    cookie过期时间
    * */
    function addCookieById(cname,id,exdays){
        var cvalue=getCookie(cname);
        if(cvalue==""){
            cvalue=id;
        }else {
            var cArray=cvalue.split(",");
            var flag=0;
            for(var i=0;i<cArray.length;i++){
                var c=cArray[i].trim();
                if(c.indexOf(id)==0){
                    flag=1;
                    break;
                }
            }
            if(flag==0) {
                cvalue += "," + id;
            }
        }

        var d=new Date();
        d.setTime(d.getTime()+(exdays*24*60*60*1000));
        var expires="expires="+d.toGMTString();
        document.cookie=cname+"="+cvalue+"; "+expires;
    }
    
        $(document).ready(function () {
            // jQuery加载后，将toggleIssueAccordion升级为带滑动动画的版本
            window.toggleIssueAccordion = function (dome) {
                var $ej = $(dome).siblings(".nav_div_ej");
                var isHidden = $ej.is(":hidden");
                $(".nav_div_ej").slideUp();
                $(".nav_div_dome").removeClass("on");
                if (isHidden) {
                    $ej.slideDown();
                    $(dome).addClass("on");
                }
            };

        });

All issues

Online First

2026

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

Security Analysis of a Modulo-2¹⁶ Implementation Variant of the MBRISI Lightweight ARX Block Cipher: Weak Keys, Deterministic Differentials, and Equivalent Keys

Abstract

Keywords

114

41

0

Further Information

Guidelines

Follow Us

Join Us

Contact Us

WhatsApp:

Share Link

Security Analysis of a Modulo-216 Implementation Variant of the MBRISI Lightweight ARX Block Cipher: Weak Keys, Deterministic Differentials, and Equivalent Keys

Abstract

Keywords

114

41

0

Further Information

Guidelines

Follow Us

Join Us

Contact Us

WhatsApp:

Share Link

Security Analysis of a Modulo-2¹⁶ Implementation Variant of the MBRISI Lightweight ARX Block Cipher: Weak Keys, Deterministic Differentials, and Equivalent Keys