SciTePress - Affiliation Profile

Research.Publish.Connect.

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Affiliation

Select a Subject
Refine Ontology Subject

Indian Institute of Technology Bombay, India

Context (please use complete words only)

Field

Sort by

17 Papers

Learning Plaintext in Galbraith’s LWE Cryptosystem

Topics: Data Integrity; Applied Cryptography

Authors: Tikaram Sanyashi , Sreyans Nahata , Rushang Dhanesha and Bernard Menezes

Affiliation: Indian Institute of Technology Bombay, Powai, Mumbai and India

Digital Object Identifier: 10.5220/0006909407250731

Proceedings of SECRYPT 2018, ISBN: 978-989-758-319-3

Quick Abstract

Unlike many widely used cryptosytems, Learning with Errors (LWE) - based cryptosystems are known to be invulnerable to quantum computers. Galbraith’s Binary LWE (GB-LWE) was proposed to reduce the large key size of the original LWE scheme by over two orders of magnitude. In GB-LWE, recovering the plaintext from the ciphertext involves solving for the binary vector x in the equation xA = b (A, a 640×256 binary matrix and b, a 256 element integer vector are knowns). Previously, lattice-based attacks on binary matrices larger than 400 × 256 were found to be infeasible. Linear programming was proposed and shown to handle significantly larger matrices but its success rate for 640 × 256 matrices was found to be negligible. Our strategy involves identification of regimes L, M and H within the output (based on LP relaxation) where the mis-prediction rates are low, medium or high respectively. Bits in the output vector are guessed and removed to create and solve a reduced instance. We report extensive experimental results on prediction accuracy and success probability as a function of number of bits removed in L, M and H. We identify trade-offs between lower execution time and greater probability of success. Our success probability is much higher than previous efforts and its execution time of 1 day with 150 cores is a partial response to the challenge posed in (Galbraith, 2013) to solve a random 640 × 256 instance using “current computing facilities in less than a year”.

Related Ontology Subjects/Areas/Topics (6)

Applied Cryptography		Data Engineering		Databases and Data Security
Cryptographic Techniques and Key Management		Data Integrity		Information and Systems Security

SheetAnim - From Model Sheets to 2D Hand-drawn Character Animation

Topics: Animation Systems; Human Figure Animation; Sketch-Based Interfaces

Authors: Heena Gupta and Parag Chaudhuri

Affiliation: IIT Bombay, India

Digital Object Identifier: 10.5220/0006514100170027

Proceedings of GRAPP 2018, ISBN: 978-989-758-287-5

Quick Abstract

We present an intuitive method to create 2D hand-drawn character animation suitable for novice animators. Given the 2D model sheet of the character that shows how the character looks from the front and side, our method can generate sketched views of the character from any direction, using the sketch stroke style used in the model sheet. Subsequently, our system can generate an animation of the character using motion capture data, and render it using the same sketched strokes. Our method is not only able to reproduce the sketch stroke style, but also the colours and other character details that the animator adds to the model sheet. The method can resolve occlusion correctly, both due to moving body parts and change in orientation of the character with respect to the camera. The animator can interactively change the sketch style, colours or other details, at any frame, as required. The animation generated by our method has the fluid style of hand sketched animation, and provides a very good starting point for novice animators that can be then improved to create the final, desired animation.

Related Ontology Subjects/Areas/Topics (6)

Animation and Simulation		Computer Vision, Visualization and Computer Graphics		Interactive Environments
Animation Systems		Human Figure Animation		Sketch-Based Interfaces

Narrow Band Pressure Computation for Eulerian Fluid Simulation

Topics: Physics-Based Animation; Scalable Fluid Simulation

Authors: Aditya Prakash and Parag Chaudhuri

Affiliation: Indian Institute of Technology Bombay, India

Digital Object Identifier: 10.5220/0006090200170026

Proceedings of GRAPP 2017/VISIGRAPP, ISBN: 978-989-758-224-0

Quick Abstract

An Eulerian fluid simulation for incompressible fluids spends a lot of time in enforcing incompressibility by solving a large Poisson’s equation. This involves solving a large system of equations using a solver like conjugate gradients. We introduce a way of accelerating this computation by dividing the grid domain of the fluid simulation into a narrow band of high resolution grid cells near fluid-solid boundaries and a coarser grid everywhere else. Judiciously reducing the number of high resolution grid cells significantly lowers the cost of the pressure projection step, while not sacrificing the simulation quality. The coarse grid values are upgraded to a finer grid before advecting the fluid surface so that enough degrees of freedom are available to resolve surface detail. We present and analyse two methods to perform this upgradation, namely, velocity interpolation and pressure field smoothing. We discuss the merits and demerits of each and quantify the errors introduced in the simulation as a function of size of the narrow band. Finally, since we are primarily interested in visualizing the fluid animation, we produce rendered fluid simulation output to also validate the visual quality of the simulations.

Related Ontology Subjects/Areas/Topics (3)

Animation and Simulation

Computer Vision, Visualization and Computer Graphics

Physics-Based Animation

TraceMove: A Data-assisted Interface for Sketching 2D Character Animation

Topics: Animation Systems; Character Animation; Sketch-Based Interfaces

Authors: Priyanka Patel , Heena Gupta and Parag Chaudhuri

Affiliation: Indian Institute of Technology Bombay, India

Digital Object Identifier: 10.5220/0005672501890197

Proceedings of GRAPP 2016/VISIGRAPP, ISBN: 978-989-758-175-5

Quick Abstract

In this paper we present TraceMove, a system to help novice animators create 2D, hand-drawn, character animation. The system and interface assists not only in sketching the character properly but also in animating it. A database of image frames, from recorded videos of humans performing various motions, is used to provide pose silhouette suggestions as a static pose hint to the users as they draw the character. The user can trace and draw over the generated suggestions to create the sketch of the pose. Then the sketch of the next frame of the animation being drawn is automatically generated by the system as a moving pose hint. In order to do this, the user marks the skeleton of the character in a single sketched pose, and a motion capture database is used to predict the skeleton for the subsequent frame. The sketched pose is then deformed according to the predicted skeleton pose. Furthermore, the sketch generated by the system for any frame can always be edited by the animator. This lets novice artists and animators generate hand-drawn 2D animated characters with minimal effort.

Related Ontology Subjects/Areas/Topics (6)

Animation and Simulation		Character Animation		Interactive Environments
Animation Systems		Computer Vision, Visualization and Computer Graphics		Sketch-Based Interfaces

Design and Implementation of an Espionage Network for Cache-based Side Channel Attacks on AES

Topics: Data Protection; Applied Cryptography; Security and Privacy in the Cloud

Authors: Bholanath Roy ¹ , Ravi Prakash Giri ² , Ashokkumar C. ¹ and Bernard Menezes ¹

Affiliations: ¹ Indian Institute of Technology - Bombay, India , ² Shri Mata Vaishno Devi University, India

Digital Object Identifier: 10.5220/0005576804410447

Proceedings of SECRYPT 2015/ICETE, ISBN: 978-989-758-117-5

Quick Abstract

We design and implement the espionage infrastructure to launch a cache-based side channel attack on AES. This includes a spy controller and a ring of spy threads with associated analytic capabilities – all hosted on a single server. By causing the victim process (which repeatedly performs AES encryptions) to be interrupted, the spy threads capture the victim’s footprints in the cache memory where the lookup tables reside. Preliminary results indicate that our setup can deduce the encryption key in fewer than 30 encryptions and with far fewer victim interruptions compared to previous work. Moreover, this approach can be easily adapted to work on diverse hardware/OS platforms and on different versions of OpenSSL.

Related Ontology Subjects/Areas/Topics (8)

Applied Cryptography	Data Engineering	Information and Systems Security
Cryptographic Techniques and Key Management	Data Protection	Security and Privacy in the Cloud
Data and Application Security and Privacy	Databases and Data Security

Modeling Neutron Dynamics in Nuclear Reactor using Fractional-order Point Reactor Kinetics Model with Adiabatic Temperature Feedback

Topics: Dynamical Systems Models and Methods; Non-Linear Systems; Mathematical Simulation

Authors: Vishwesh Vyawahare ¹ and P. S. V. Nataraj ²

Affiliations: ¹ Ramrao Adik Institute of Technology, India , ² Indian Institute of Technology Bombay, India

Digital Object Identifier: 10.5220/0005038103520360

Proceedings of SIMULTECH 2014, ISBN: 978-989-758-038-3

Quick Abstract

This paper deals with the development and analysis of fractional-order (FO) point reactor kinetics (FPRK) model with reactivity feedback for a nuclear reactor. Incorporation of adiabatic temperature feedback of reactivity makes this model nonlinear. It basically forms a system of coupled, nonlinear ordinary differential equations. The nonlinear subprompt critical FPRK model is developed and analyzed in detail. Fundamental motivation for this model is the fact that neutron transport inside the core of a reactor is truly a subdiffusion. The work presented here analyzes the effect of temperature feedback on the neutron concentration dynamics inside reactor core which is modeled using fractional differential equations. The system of nonlinear differential equations is solved numerically. The analysis clearly establishes the fact that the proposed model is ‘stable’ in the sense that it predicts self-limitting power excursions. The model presented in this paper constitutes an important step in the development of fractional-order model for a nuclear reactor, which can be used to achieve better control and operation.

Related Ontology Subjects/Areas/Topics (5)

Dynamical Systems Models and Methods		Mathematical Simulation		Simulation and Modeling
Formal Methods		Non-Linear Systems

Optimizing Elliptic Curve Scalar Multiplication with Near-Factorization

Topics: Applied Cryptography; Network Security

Authors: Pratik Poddar , Achin Bansal and Bernard Menezes

Affiliation: Indian Institute of Technology - Bombay, India

Digital Object Identifier: 10.5220/0005058703610370

Proceedings of SECRYPT 2014/ICETE, ISBN: 978-989-758-045-1

Quick Abstract

Elliptic curve scalar multiplication ( [k]P where k is an integer and P is a point on the elliptic curve) is widely used in encryption and signature generation. In this paper, we explore a factorization-based approach called Near-Factorization that can be used in conjunction with existing optimization techniques such as Window NAF (Non Adjacent Form). We present a performance model of Near-Factorization and validate model results with those from a simulation. We compare Near-Factorization with wNAF for a range of scalar sizes, window sizes, divisor lengths and Hamming weights of divisor. The use of Near-Factorization with wNAF results in a considerable reduction in the effective Hamming weight of the scalar and a reduction in overall computation cost for Koblitz curves.

Related Ontology Subjects/Areas/Topics (7)

Applied Cryptography	Databases and Data Security	Network Security
Cryptographic Techniques and Key Management	Information and Systems Security	Wireless Network Security
Data Engineering

A Fuzzy-stochastic Inventory Model without Backorder under Uncertainty in Customer Demand

Topics: Optimization; Management Sciences; Industrial Engineering; Inventory Theory; Mathematical Modeling

Authors: Pankaj Dutta and Madhukar Nagare

Affiliation: Indian Institute of Technology Bombay, India

Digital Object Identifier: 10.5220/0004342801090114

Proceedings of ICORES 2013, ISBN: 978-989-8565-40-2

Quick Abstract

In the current business scenario, a vital aspect of a realistic inventory model is to accurately estimate the customer demand especially in uncertain environment. Keeping this fact in mind recent trend of research includes uncertain demand, either random or fuzzy. In this paper, we amalgamate both random behavior and fuzzy perception into the optimization setting in modeling an inventory model without backorder. Treating customer demand as fuzzy random variable, we aim at providing an approach of modeling uncertainty that is closer to real situations. In addition, a distinct characteristic of this study is that the decision maker’s degree of optimism is incorporated in this model using possibilistic mean value approach. The objective is to determine the optimal order quantity associated with cost minimization. An illustrative numerical example is presented to clarify the reality of the model.

Related Ontology Subjects/Areas/Topics (11)

Artificial Intelligence	Knowledge-Based Systems	Operational Research
Industrial Engineering	Management Sciences	Optimization
Inventory Theory	Mathematical Modeling	Symbolic Systems
Knowledge Discovery and Information Retrieval	Methodologies and Technologies

Directable Animation of Non-photorealistic Fluids

Topics: Physics-Based Animation; Sketch-Based Interfaces

Authors: Viraj Churi , Gaurav Bhagwat and Parag Chaudhuri

Affiliation: Indian Institute of Technology Bombay, India

Digital Object Identifier: 10.5220/0004277402540260

Proceedings of GRAPP 2013/VISIGRAPP, ISBN: 978-989-8565-46-4

Quick Abstract

This paper presents a method to control and direct a physically-based fluid simulation with user defined strokes. Strokes are interpreted as flowlines and introduce a smooth velocity field in their vicinity that allows the fluid simulation to be easily directed by an animator. We also allow the fluid to interact with arbitrarily shaped obstacles and have variable viscosity during the simulation. The strokes can be alive for a finite duration and are registered to a timeline to give keyframing like control to the animator over the physics driven simulation.

Related Ontology Subjects/Areas/Topics (5)

Animation and Simulation		Interactive Environments		Sketch-Based Interfaces
Computer Vision, Visualization and Computer Graphics		Physics-Based Animation

Hardware-software Scalable Architectures for Gaussian Elimination over GF(2) and Higher Galois Fields

Topic: VLSI Design and Implementation

Authors: Prateek Saxena ¹ , Vinay B. Y. Kumar ¹ , Dilawar Singh ¹ , H Narayanan ² and Sachin B. Patkar ¹

Affiliations: ¹ Indian Institute of Technology Bombay, India , ² Indian Institute of Technology and Bombay, India

Digital Object Identifier: 10.5220/0004313201950201

Proceedings of PECCS 2013, ISBN: 978-989-8565-43-3

Quick Abstract

Solving a System of Linear Equations over Finite Fields finds one of the most important practical applications, for instance, in problems arising in cryptanalysis and network coding among others. However, other than software-only approaches to acceleration, the amount of focus particularly towards hardware or hardware/software based solutions is small, in comparison to that towards general linear equation solvers. We present scalable architectures for Gaussian elimination with pivoting over GF(2) and higher fields, both as custom extensions to commodity processors or as dedicated hardware for larger problems. In particular, we present: 1) Designs of components---Matrix Multiplication and `Basis search and Inversion'---for Gaussian elimination over GF(2), prototyped as custom instruction extensions to Nios-II on DE2-70(DE2, 2008), which even with a 50MHz clock perform at $\approx$30~GOPS (billion GF(2) operations); and also report results for GF($2^8$) or higher order matrix multiplication with about 20~GOPS performance at 200MBps. 2) A scalable extension of a previous design [Bogdanov et. al, 2006] for multiple FPGAs and with $\approx$2.5 TrillionOPS performance at ~5GBps bandwidth on a Virtex-5 FPGA

Related Ontology Subjects/Areas/Topics (3)

Embedded Communications Systems

Telecommunications

VLSI Design and Implementation