Long Modular Multiplication for Cryptographic Applications

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-28632-5_4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

IPLDS: Integrity Protection for Long Data Streams in Wireless Sensor Networks Using Montgomery Modular Multiplication

2017English

Novel RNS Parameter Selection for Fast Modular Multiplication

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2014English

Efficient Pipelining for Modular Multiplication Architectures in Prime Fields

2007English

Testing of Large Number Multiplication Functions in Cryptographic Systems

English

High-Performance VLSI Architecture for SCS Based Montgomery Modular Multiplication

IOSR Journal of VLSI and Signal Processing
2016English

Fast Modular Multiplication Using Parallel Prefix Adder

International Journal of Trend in Scientific Research and Development
2018English

Modular Divider for Elliptic Curve Cryptographic Hardware Based on Programmable CA

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Hardware Implementation of Montgomery's Modular Multiplication Algorithm

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
1993English

Efficient Pseudo-Chaotic Number Generator for Cryptographic Applications

International Journal of Intelligent Computing Research
2020English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy