Elliptic Curve Point Multiplication by Generalized Mersenne Numbers

    在线阅读 下载PDF 导出详情
    摘要 Montgomerymodularmultiplicationintheresiduenumbersystem(RNS)canbeappliedforellipticcurvecryptography.Inthiswork,unifiedmodularmultipliersovergeneralizedMersennenumbersareproposedforRNSMontgomerymodularmultiplication,whichenablesefficientellipticcurvepointmultiplication(ECPM).Meanwhile,theellipticcurvearithmeticwithECPMisperformedbymixedcoordinatesandadjustedforhardwareimplementation.Inaddition,theconversionbetweenRNSandthebinarynumbersystemisalsodiscussed.Comparedwiththeresultsintheliterature,ourhardwarearchitectureforECPMdemonstrateshighperformance.A256-bitECPMinXilinxXC2VP100fieldprogrammablegatearraydevice(FPGA)canbeperformedin1.44ms,costing22147slices,45dedicatedmultipliers,and8.25Kbitsofrandomaccessmemories(RAMs).
    机构地区 不详
    出版日期 2012年03月13日(中国Betway体育网页登陆平台首次上网日期,不代表论文的发表时间)
    • 相关文献
    Baidu
    map