Fast Modular Reduction over Euclidean Rings and Its Application to Universal Hash Functions(<Special Section>Cryptography and Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• In this letter, we propose a fast modular reduction method over Euclidean rings, which is a generalization of Barrett's reduction algorithm over the ring of integers. As an application, we construct new universal hash function families whose operations are modular arithmetic over a Euclidean ring, which can be any of three rings, the ring of integers, the ring of Gauss integers and the ring of Eisenstein integers. The implementation of these families is efficient by using our method.

• 社団法人電子情報通信学会の論文
• 2005-01-01

著者

• Hu Lei

  The State Key Laboratory Of Information Security (graduate School Of Chinese Academy Of Sciences)

• Zeng Xiangyong

  The Faculty Of Mathematics And Computer Science Hubei University

関連論文

• Fast Modular Reduction over Euclidean Rings and Its Application to Universal Hash Functions(Cryptography and Information Security)

スポンサーリンク