The RSA cryptography processor

DOI10.1007/3-540-39118-5_10zbMATH Open1464.94050OpenAlexW1528464616MaRDI QIDQ5000236FDOQ5000236

Authors: Holger Sedlak 

Publication date: 10 July 2021

Published in: Advances in cryptology -- EUROCRYPT '87. Workshop on the theory and application of cryptographic techniques, Amsterdam, Netherlands, April 13--15, 1987. Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-39118-5_10

Recommendations

• scientific article; zbMATH DE number 503341
• scientific article; zbMATH DE number 1618065
• A systolic, high speed architecture for an RSA cryptosystem
• scientific article; zbMATH DE number 65248
• High-Speed RSA Crypto-processor with Radix-4 Modular Multiplication and Chinese Remainder Theorem

zbMATH Keywords

full addermodular multiplicationmodulo operationflow bufferprocessor cycle

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Recent developments in primality testing
• Title not available (Why is that?)

Cited In (4)

• An LSI digital encryption processor (DEP)
• Design of RSA crypto-coprocessor based on the Barrett's modular multiplication algorithm
• Title not available (Why is that?)
• Public-key cryptography on smart cards

This page was built for publication: The RSA cryptography processor

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