<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Aditi Gupta on The Trail of Bits Blog</title><link>https://miscreants.github.io/blog.trailofbits.com/authors/aditi-gupta/</link><description>Recent content in Aditi Gupta on The Trail of Bits Blog</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Mon, 02 Sep 2019 06:50:31 -0400</lastBuildDate><atom:link href="https://miscreants.github.io/blog.trailofbits.com/authors/aditi-gupta/index.xml" rel="self" type="application/rss+xml"/><item><title>Rewriting Functions in Compiled Binaries</title><link>https://miscreants.github.io/blog.trailofbits.com/2019/09/02/rewriting-functions-in-compiled-binaries/</link><pubDate>Mon, 02 Sep 2019 06:50:31 -0400</pubDate><guid>https://miscreants.github.io/blog.trailofbits.com/2019/09/02/rewriting-functions-in-compiled-binaries/</guid><description>As a summer intern at Trail of Bits, I’ve been working on building Fennec, a tool to automatically replace function calls in compiled binaries that’s built on top of McSema, a binary lifter developed by Trail of Bits. The Problem Let’s say you have a compiled binary, but you […]</description></item><item><title>Fault Analysis on RSA Signing</title><link>https://miscreants.github.io/blog.trailofbits.com/2018/08/14/fault-analysis-on-rsa-signing/</link><pubDate>Tue, 14 Aug 2018 12:39:52 -0400</pubDate><guid>https://miscreants.github.io/blog.trailofbits.com/2018/08/14/fault-analysis-on-rsa-signing/</guid><description>This spring and summer, as an intern at Trail of Bits, I researched modeling fault attacks on RSA signatures. I looked at an optimization of RSA signing that uses the Chinese Remainder Theorem (CRT) and induced calculation faults that reveal private keys. I analyzed fault attacks at a low level rather than in […]</description></item></channel></rss>