Increasing the bitlength of a crypto-coprocessor

MaRDI QIDQ4425688zbMATH OpenFDO

Authors Wieland Fischer, Jean-Pierre Seifert

Publication date 11 September 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2523/25230071.htm

zbMATH Keywords

arithmetical coprocessordoubling algorithmhardware architecturehardware/software codesignmodular multiplication

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Mathematical problems of computer architecture (68M07) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Recommendations

• Unbridle the Bit-Length of a Crypto-coprocessor with Montgomery Multiplication
• CryptoBooster: A reconfigurable and modular cryptographic coprocessor
• Instruction Set Extensions for Pairing-Based Cryptography
• Low-cost double-size modular exponentiation or how to stretch your cryptoprocessor
• On increasing the throughput of stream ciphers
• Boosting AES Performance on a Tiny Processor Core
• Tweak-length extension for tweakable blockciphers

Cited in

(3)

• Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients
• Unbridle the Bit-Length of a Crypto-coprocessor with Montgomery Multiplication
• Breaking and Fixing Cryptophia’s Short Combiner

This page was built for publication: Increasing the bitlength of a crypto-coprocessor

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