New left-to-right minimal weight signed-digit radix-r representation

DOI10.1016/J.COMPELECENG.2008.09.007MaRDI QIDQ1013350zbMATH OpenOpenAlexFDO

Authors Baodong Qin, Ming Li, Fanyu Kong, Daxing Li

Publication date 17 April 2009

Published in Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.compeleceng.2008.09.007

zbMATH Keywords

integer recodingleft-to-right recodingnon-adjacent formpairing based cryptosystemssigned radix-\(r\) representation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• New Left-to-Right Radix-r Signed-Digit Recoding Algorithm for Pairing-Based Cryptosystems
• Topics in Cryptology – CT-RSA 2005
• A Simple Left-to-Right Algorithm for Minimal Weight Signed Radix-$r$ Representations
• Information Security
• Selected Areas in Cryptography

Cited in

(10)

• scientific article; zbMATH DE number 2085444 (Why is no real title available?)
• Optimal left-to-right binary signed-digit recoding
• A Simple Left-to-Right Algorithm for Minimal Weight Signed Radix-$r$ Representations
• Secure Signed Radix-r Recoding Methods for Constrained-Embedded Devices
• Advances in Cryptology – CRYPTO 2004
• New Left-to-Right Radix-r Signed-Digit Recoding Algorithm for Pairing-Based Cryptosystems
• Selected Areas in Cryptography
• Information Security
• Topics in Cryptology – CT-RSA 2005
• Balanced non-adjacent forms

This page was built for publication: New left-to-right minimal weight signed-digit radix-\(r\) representation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013350)