Exploiting Linearity of Modular Multiplication

DOI10.1007/978-3-030-43120-4_19OpenAlexW3011847919MaRDI QIDQ5014681FDOQ5014681

Authors: Hamdi Murat Yıldırım 

Publication date: 8 December 2021

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/75768

Recommendations

• Efficient Modular Arithmetic
• scientific article; zbMATH DE number 1294069
• A faster modular multiplication algorithm
• Fast integer multiplication using modular arithmetic
• New modular multiplication algorithms for fast modular exponentiation
• New iterative algorithms for modular multiplication
• A fast modular multiplication algorithm
• Computing modular polynomials in quasi-linear time
• An Algorithm for Multiplication in Modular Arithmetic
• Modular Matrix Multiplication on a Linear Array

zbMATH Keywords

nonlinearityBoolean functionscryptanalysismodular multiplicationIDEA cipher

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Cites Work

• Title not available (Why is that?)
• Revisiting the IDEA Philosophy
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Progress in Cryptology - INDOCRYPT 2003
• Lai-Massey Cipher Designs

Cited In (2)

• Fast Software Encryption
• Linear Approximations of Addition Modulo 2n-1

This page was built for publication: Exploiting Linearity of Modular Multiplication

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