src_e53adb99e40ae66258
- Source-provided label
- Not reported
- Evidence class
- mentioned in report
- Confidence
- Not reported
- Observed
- Oct 06, 2026 19:00 UTC
- Retrieved
- Oct 08, 2026 03:46 UTC
ePrint Report: Optimizing Montgomery Arithmetic for RSA on Cortex-M0+ and Cortex-M3 Minoo Sim, Minwoo Lee, Seungwon Lee, SuBeen Cho, Jiwon Bang, Hwajeong Seo Cryptographic tokens that retain RSA credentials for compatibility with existing authentication systems require efficient private-key operations on small processors. Cortex-M0+ (M0+) lacks native widening multiplication, whereas Cortex-M3 (M3
Optimizing Montgomery Arithmetic for RSA on Cortex-M0+ and Cortex-M3927989faeda4d58f154de07a473e03982de6964153b227d7f32dc71d8e0995fbNetwork indicators are visibly defanged. This page does not make them clickable or send them to another service.
No validated file hashes or network indicators are stored for this record.
This record contains metadata and attribution only. It does not host, download, unpack, render, or execute malware samples.
Sources represented on this page. Publication and observation dates describe the content; successful batch dates describe local collection. A recent batch does not certify complete coverage or current provider availability.
1 sources: 0 stale, 0 needing attention, 0 paused, 1 unverified.
Stale means older than twice the recorded collection interval, with a minimum of one hour; without an interval, the threshold is 24 hours. Cached content remains available while a feed is stale, paused, or unverified.