header
Image from OpenLibrary

Design and VLSI implementation of fast modular multipliier architectures for cryptosystems / Atef Ali Ibrahim Mohamed ; Supervised Ameen Mohamed Nassar , Fayez Hassan Gebali , Hamed Abdelghafar Elsimary

By: Contributor(s): Material type: TextTextLanguage: English Publication details: Cairo : Atef Ali Ibrahim Mohamed , 2010Description: 183P. : charts ; 30cmOther title:
  • تصميم بنايات الضارب المتبقى السريعة لانظمة التشفير وتحقيقها باستخدام الدوائر المتكاملة عالية الكثافة [Added title page title]
Subject(s): Available additional physical forms:
  • Issued also as CD
Dissertation note: Thesis (Ph.D.) - Cairo University - Faculty of Engineering - Department of Electronics and communication Summary: The main goal of this work is to describe an efficient hardware implenmentation for a montgomery modular multiplier . We have several contributions in this dissertation considering this main goal . First we proposed a modified fixed operand size montgomery modular multiplication algorithm . Second we presented a systematic methodology for exploring all all possible processor arrays of the scalable montgomery algoithm
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Call number Copy number Status Date due Barcode
Thesis Thesis قاعة الرسائل الجامعية - الدور الاول المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.13.08.Ph.D.2010.At.D (Browse shelf(Opens below)) Not for loan 01010110053505000
CD - Rom CD - Rom مخـــزن الرســائل الجـــامعية - البدروم المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.13.08.Ph.D.2010.At.D (Browse shelf(Opens below)) 53505.CD Not for loan 01020110053505000

Thesis (Ph.D.) - Cairo University - Faculty of Engineering - Department of Electronics and communication

The main goal of this work is to describe an efficient hardware implenmentation for a montgomery modular multiplier . We have several contributions in this dissertation considering this main goal . First we proposed a modified fixed operand size montgomery modular multiplication algorithm . Second we presented a systematic methodology for exploring all all possible processor arrays of the scalable montgomery algoithm

Issued also as CD

There are no comments on this title.

to post a comment.