I work in Query Suggestions team responsible for developing the ‘People Also Ask’ answer in Bing. We provide relevant Question-Answers to user's original query.

Search projects and priorities, including new LLM integration efforts, website indexing and related search applications and maintenance.

• Working in the Document Technology team on website indexing, boosting relevance for search queries, documentation search-engine optimization, and other related search applications, bugs and maintenance.(shipping high-performance, scalable code in Java, C, Python and/or Wolfram Language; build tools: TeamCity, Jenkins, Gradle; version controls: git, JIRA)

Working in Special Projects group of the Office of Stephen Wolfram Operations Department under R&D division.

Secured a place in the selective 2020 Wolfram Summer School with full financial aid, and developed an original research project on numerical analysis and computer arithmetic using Mathematica, titled "Implementation of Level-index Arithmetic for Very Large Numbers".Project Abstract: To represent extremely large real numbers, e.g., Tetrational numbers or huge Power Towers, in the ordinary level-index arithmetic format. Floating-point arithmetic is inadequate to represent these kinds of large numbers, as they are much bigger than the largest real number that can be represented in the Wolfram Language, and hence suffers the problem of overflow. This project introduces a new large number format in Mathematica to virtually abolish the problem of overflow, and adds support for this new format in many of the usual mathematical operations such as +, *, ^ etc.Research Published at: https://community.wolfram.com/groups/-/m/t/2030201?p_p_auth=QVkc7FxB

Project: Worker-node model for MP-SPDZ (Applied Cryptography)Mentor: Dhinakaran VinayagamurthyObjective: To develop a framework for N parties who want to jointly compute a function with their individual inputs while keeping their inputs secret, and also want the final outcome to be differentially private, i.e, a noisy result instead of providing the actual result.Expected outcomes: Prototype, paperActual outcomes: One of the 11 global contributors of IBM's Differential Privacy library; changed upper bound of variance from (upper - lower) ** 2 to ((upper - lower) ** 2) / 4 guaranteed by Popoviciu's inequality (https://github.com/IBM/differential-privacy-library/pull/45)

Summer Research Intern at R.C. Bose Centre for Cryptology and Security powered by Microsoft Research India.Details:Initially did a reading project under Dr. Mridul Nandi on AES and it's modes of operations(special attention to Galois Counter Mode of operation).Then, worked under Dr. Nilanjan Datta and Mr. Ashwin Jha on Differential and Linear Cryptanalysis of AES and related block ciphers. • Wrote a general code to form an LP file which will serve as the instruction for GNU's GLPK tool to find the number of Active S-Boxes for any given rounds of ANY GIVEN Block Cipher,which can be considered as an updated code that N Mouha described in his paper Differential and Linear Cryptanalysis using Mixed Integer Linear Programming for only AES(https://www.esat.kuleuven.be/cosic/publications/article-2080.pdf)• Wrote a generalized optimized code to find the branch number of any given block cipher, and then by using GLPK solver find out the number of active S-boxes for any rounds of any block cipher and hence using mathematical relations determine whether the cipher is resistant against Differential and Linear Cryptanalysis or not.Result: This code was hence built with the intention of making it work as an automated solver for any block cipher to determine whether it is resistant to linear and differential cryptanalysis or not. With certain precomputations, the optimised code worked somewhat within 2 seconds and gave correct result.Medium Blog Article: https://medium.com/@justanotherlad/generalized-linear-and-differential-cryptanalysis-check-for-any-block-cipher-r-c-bose-bac010b7d6e6