Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
12
click to vote
ARITH
1993
IEEE
favorite
Email
discuss
report
77
views
Applied Computing
»
more
ARITH 1993
»
High-radix modular multiplication for cryptosystems
14 years 22 days ago
Download
www.acsel-lab.com
Peter Kornerup
Real-time Traffic
Applied Computing
|
ARITH 1993
|
claim paper
Related Content
»
SPA against an FPGABased RSA Implementation with a HighRadix Montgomery Multiplier
»
Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Method...
»
An Elliptic Curve Cryptosystem Design Based on FPGA Pipeline Folding
»
Efficient Hardware Architectures for Modular Multiplication on FPGAs
»
Speeding Up Bipartite Modular Multiplication
»
Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field
»
FPGA Implementation of an Elliptic Curve Cryptosystem over GF3m
»
Hardware Implementation of a Montgomery Modular Multiplier in a Systolic Array
»
Charm A framework for Rapidly Prototyping Cryptosystems
more »
Post Info
More Details (n/a)
Added
08 Aug 2010
Updated
08 Aug 2010
Type
Conference
Year
1993
Where
ARITH
Authors
Peter Kornerup
Comments
(0)
Researcher Info
Applied Computing Study Group
Computer Vision