Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 30 of 40

Full-Text Articles in Physical Sciences and Mathematics

Secret Sharing And Its Variants, Matroids,Combinatorics., Shion Samadder Chaudhury Dr. Dec 2021

Secret Sharing And Its Variants, Matroids,Combinatorics., Shion Samadder Chaudhury Dr.

Doctoral Theses

The main focus of this thesis is secret sharing. Secret Sharing is a very basic and fundamental cryptographic primitive. It is a method to share a secret by a dealer among different parties in such a way that only certain predetermined subsets of parties can together reconstruct the secret while some of the remaining subsets of parties can have no information about the secret. Secret sharing was introduced independently by Shamir [139] and Blakely [20]. What they introduced is called a threshold secret sharing scheme. In such a secret sharing scheme the subsets of parties that can reconstruct a secret …


Integrated Shift And Drift Control Of A Non-Linear Growth Process., Soham Chakraborty Dr. May 2021

Integrated Shift And Drift Control Of A Non-Linear Growth Process., Soham Chakraborty Dr.

Doctoral Theses

In the field of Quality Control (QC), the term 'control' is used to mean many different things. For example, it may refer to an isolated control action (e.g. a process adjustment), a particular type of control architecture (e.g. feedback vs. feed forward control) or even a control discipline (e.g. Deming's PDCA cycle). So will be the case here. But the exact meaning will be clear from the context.Since the development of control chart by Shewhart [1] and the method of acceptance sampling by Dodge and Romig [2] during 1920's - 1940's, the field of quality control has been greatly enriched …


Studies On Diagnostic Coverage And X-Sensitivity In Logic Circuits., Manjari Pradhan Dr. Apr 2021

Studies On Diagnostic Coverage And X-Sensitivity In Logic Circuits., Manjari Pradhan Dr.

Doctoral Theses

Today’s integrated circuits comprise billions of interconnected transistors assembled on a tiny silicon chip, and testing them to ensure functional and timing correctness continues to be a major challenge to designers and test engineers with further downscaling of transistors. Although substantial progress has been witnessed during the last five decades in the area of algorithmic test generation and fault diagnosis, applications of combinatorial and machinelearning (ML) techniques to solve these problems remain largely unexplored till date. In this thesis, we study three problems in the context of digital logic test and diagnosis. The first problem is that of fault diagnosis …


Quantum Markov Maps: Structureand Asymptotics., Vijaya Kumar U. Dr. Feb 2021

Quantum Markov Maps: Structureand Asymptotics., Vijaya Kumar U. Dr.

Doctoral Theses

No abstract provided.


Some Topics Involving Derived Categories Over Noetherian Formal Schemes., Saurabh Singh Dr. Sep 2020

Some Topics Involving Derived Categories Over Noetherian Formal Schemes., Saurabh Singh Dr.

Doctoral Theses

There are two parts to this thesis and both the parts involve working with derived categories over noetherian formal schemes. Beyond this there is no overlap between them and we discuss them separately.The first part concerns Grothendieck duality on noetherian formal schemes.Grothendieck duality is a vast generalisation of Serreduality in algebraic geometry. The main statements in this theory are expressed in the language of derived categories. We begin with an important special case.Let f : X → Y be a proper map of noetherian schemes which is smooth of relative dimension n. For any G ∈ D+ qc(Y ) (where …


Essays On Conflict And Organisation Theory., Dushyant Kumar Dr. Jun 2016

Essays On Conflict And Organisation Theory., Dushyant Kumar Dr.

Doctoral Theses

Throughout the human civilization, domestic (intra country) conflicts have been present across societies, cultures and countries. These conflicts are extremely common as well as persistent. For the period 1960-2006, twenty percent of the countries have experienced at-least ten years of conflicts with more than 1000 casualties per year (Blattman and Miguel, 2010). It causes huge loss of human life, quantitatively, as well as qualitatively. It results in huge number of casualties, as well as damage to the existing output, resources and infrastructure. The persistent presence of such conflicts across the world means that a significant number of people as well …


Efficient And Adaptively Secure Constructions Of Identity-Based Cyrptographic Primitives., Somindu Chaya Ramanna Dr. Feb 2016

Efficient And Adaptively Secure Constructions Of Identity-Based Cyrptographic Primitives., Somindu Chaya Ramanna Dr.

Doctoral Theses

Public-key encryption (PKE) is an elegant solution to the fundamental problem of cryptography – secure communication between two parties over a public (insecure) channel. The basic idea is that every user A holds two keys – a public key (PKA) and a secret key (SKA). A user who wants to send a message to A encrypts it with PKA and sends the resulting ciphertext along the public channel. A, at the other end of the channel, decrypts the ciphertext using SKA and obtains the message. SKA is known to user A alone. Any third party intercepting data on the public …


Application Of Combinatorial Structures In Wireless Communication., Samiran Bag Dr. Jan 2016

Application Of Combinatorial Structures In Wireless Communication., Samiran Bag Dr.

Doctoral Theses

Wireless communication has a compelling need in today’s world. This need is driven by the sudden surge in the demand of ad-hoc networks like wireless sensor networks. These networks consist of many isolated devices called nodes that use the wireless medium for communication. There are three security notions attached to any wireless communication. These are data confidentiality, data integrity and data availability. Cryptographic protocols are required for achieving the first two notions which in turn require shared secret keys. The last notion viz. data availability mainly deals with protecting the data from ‘denial of service attack’.In this thesis, we apply …


Coverage And Detection In Wireless Sensor Networks., Mrinal Nandi Dr. Feb 2014

Coverage And Detection In Wireless Sensor Networks., Mrinal Nandi Dr.

Doctoral Theses

A Wireless Sensor Networks (WSNs), which are two or three dimensional systems, usually consist of a large number of small sensors equipped with some processing circuit, and a wireless transceiver. The sensors have small size, low battery capacity, non-renewable power supply, small processing power, limited buffer capacity and low-power radio. They may measure distance, direction, speed, humidity, wind speed, soil makeup, temperature, chemicals, light, and various other parameters. The sensors are autonomous devices with integrated sensing, processing, and communication capabilities.In this thesis, we consider ‘coverage problem’ and ‘detection problem’ in Wireless Sensor Networks (WSNs) in grid as well as in …


Spectrum Estimation With Uniformly And Stochastically Sampled Data: Some Challenges And Strategies., Radhendushka Srivastava Dr. Apr 2012

Spectrum Estimation With Uniformly And Stochastically Sampled Data: Some Challenges And Strategies., Radhendushka Srivastava Dr.

Doctoral Theses

No abstract provided.


Distributed Algorithms For Initialization And Topology Control In Wireless Ad Hoc Networks., Subhasis Bhattacharjee Dr. Jul 2011

Distributed Algorithms For Initialization And Topology Control In Wireless Ad Hoc Networks., Subhasis Bhattacharjee Dr.

Doctoral Theses

Wireless ad hoc networking is an upcoming communication technology that makes exchange of information possible without any pre-existing infrastructure. Over the last decade it has grabbed tremendous interest in the research community due to its easy deployability and high flexibility, with numerous applications to social, industrial and personal uses. In this thesis, we designed effcient light weight distributed algorithms based on minimal local information to resolve the problems related to the initialization and topology configuration of wireless ad hoc networks with special emphasis on optimal utilization of limited resources. Once the ad hoc nodes with in-built radio transceivers are deployed …


Studies On Public Key And Identity-Based Cryptographic Primitives., Mahabir Prasad Jhanwar Dr. Feb 2011

Studies On Public Key And Identity-Based Cryptographic Primitives., Mahabir Prasad Jhanwar Dr.

Doctoral Theses

No abstract provided.


Fast Placement And Floorplanning Methods In Modern Reconfigurable Fpgas., Pritha Baneerjee Dr. Jun 2010

Fast Placement And Floorplanning Methods In Modern Reconfigurable Fpgas., Pritha Baneerjee Dr.

Doctoral Theses

FPGA Field-programmable gate-arrays (FPGA) are programmable hardware platforms with pre-fabricated logic and interconnects, which are electrically programmed by the user to realize a variety of circuits frequently required in a wide range of applications. Unlike application-specific integrated-circuits (ASICs), where realization of a circuit design takes several man-hours and enormous effort, the pre-fabricated logic and interconnects can be quickly programmed according to the design specification and made functional. Thus, in contrast to the ASICs, FPGAs can be customized and reconfigured depending on the need of the user. A basic FPGA chip consists of a set of configurable logic blocks (CLB) and …


Versal Deformations Of Leibniz Algebra., Ashis Mandal Dr. Jul 2009

Versal Deformations Of Leibniz Algebra., Ashis Mandal Dr.

Doctoral Theses

No abstract provided.


Studies On Construction And List Decoding Of Codes On Some Towers Of Function Fields., M. Prem Laxman Das Dr. Mar 2009

Studies On Construction And List Decoding Of Codes On Some Towers Of Function Fields., M. Prem Laxman Das Dr.

Doctoral Theses

In everyday life, there arise many situations where two parties, sender and receiver, need to communicate. The channel through which they communicate is assumed to be binary symmetric, that is, it changes 0 to 1 and vice versa with equal probability. At the receiver’s end, the sent message has to be recovered from the corrupted received word using some reasonable mechanism. This real life problem has attracted a lot of research in the past few decades. A solution to this problem is obtained by adding redundancy in a systematic manner to the message to construct a codeword. The collection of …


Placement And Range Assignment In Power-Aware Radio Networks., Gautam Kumar Das Dr. Feb 2009

Placement And Range Assignment In Power-Aware Radio Networks., Gautam Kumar Das Dr.

Doctoral Theses

Due to the extraordinary growth of demand in mobile communication facility, design of efficient systems for providing specialized services has become an important issue in wireless mobility research. Broadly speaking, there are two major models for wireless networking: single-hop and multi-hop. The single-hop model [110] is based on the cellular network, and it provides one-hop wireless connectivity between the host and the static nodes known as base stations. single-hop networks rely on a fixed backbone infrastructure that interconnects all the base stations by high speed wired links. On the other hand, the multi-hop model requires neither fixed wired infrastructure nor …


Applications Of Combinatorial Designs In Key Pre-Distribution In Sensor Networks., Dibyendu Chakrabarti Dr. Sep 2008

Applications Of Combinatorial Designs In Key Pre-Distribution In Sensor Networks., Dibyendu Chakrabarti Dr.

Doctoral Theses

Key pre-distribution is an important area of research in Distributed Sensor Networks (DSN). Some improved techniques over the existing schemes (employing combinatorial designs) have been proposed in this thesis and detailed mathematical analysis of the schemes has been presented. At first, combinatorial design followed by randomized merging strategy is applied to key pre-distribution in sensor nodes. Our main target is to get more than one pair of common keys between any pair of nodes to provide a robust network in terms of security under adversarial conditions where some nodes may get compromised. A transversal design is used to construct a …


Some Necessary Conditions Of Boolean Functions To Resist Algebraic Attacks., Deepak Dalai Dr. Aug 2007

Some Necessary Conditions Of Boolean Functions To Resist Algebraic Attacks., Deepak Dalai Dr.

Doctoral Theses

No abstract provided.


Construction Of (Hierarchical) Identity-Based Encryption Protocols Using Bilinear Pairing., Sanjit Chatterjee Dr. Aug 2007

Construction Of (Hierarchical) Identity-Based Encryption Protocols Using Bilinear Pairing., Sanjit Chatterjee Dr.

Doctoral Theses

Science, it is argued [65], advances through paradigm shifts. Concepts emerge that open-up new vistas of research, fundamentally changing the way we are used to looking at things. Between these paradigm shifts remain the periods of consolidation. Periods when human mind explores the newly found territory, shedding light on hitherto unknown dimensions. If radical changes are the hallmarks of paradigm shifts, the period within witnesses small but continuous developments, occasionally marked by its own milestones. It is in these periods that human faculty tries to grasp the full significance of the new concepts, consolidates its gains and thereby pushes the …


Design Of Iteration On Hash Functions And Its Cryptanalysis., Mridul Nandi Dr. May 2006

Design Of Iteration On Hash Functions And Its Cryptanalysis., Mridul Nandi Dr.

Doctoral Theses

No abstract provided.


Studies On Pairing-Based And Constant Round Dynamic Group Key Agreement., Ratna Dutta Dr. Feb 2006

Studies On Pairing-Based And Constant Round Dynamic Group Key Agreement., Ratna Dutta Dr.

Doctoral Theses

This thesis describes research that I conducted during the course of my Ph.D. study at Indian Statistical Institute (ISI), Kolkata. I hope that this work is of use and will be carried on.I would like to begin by thanking my supervisor, Prof. Rana Barua for his support and endless patience. He has provided me background in Cryptography, Combinatorics and Theory of Automata during the period 2000-2002 of my course work of M.Tech in Computer Science at Indian Statistical Institute. I really appreciate his extraordinary patience in reading my numerous inferior drafts, for listening and analyzing all my ideas, forcing me …


Cryptographic And Combinatorial Properties Of Boolean Functions And S-Boxes., Kishan Chand Gupta Dr. Feb 2005

Cryptographic And Combinatorial Properties Of Boolean Functions And S-Boxes., Kishan Chand Gupta Dr.

Doctoral Theses

In this thesis we study combinatorial aspects of Boolean functions and S-boxes with impor- tant cryptographic properties and construct new functions possesing such properties. These have possible applications in the design of private key (symmetric key) cryptosystems.Symmetric key cryptosystems are broadly divided into two classes.1. Stream Ciphers,2. Block Ciphers.Some recent proposals of stream ciphers are SNOW [37], SCREAM [52], TURING (98], MUGI (117), HBB (102], RABBIT (9), HELIX (38] and some proposals of block ciphers are DES, AES, RC6 [97), MARS (12], SERPENT (6], TWOFISH (104].In stream cipher cryptography a pseudorandom sequence of bits of length cqual to the message …


On Some Generalized Transforms For Signal Decomposition And Reconstruction., Yumnam Singh Dr. Jan 2005

On Some Generalized Transforms For Signal Decomposition And Reconstruction., Yumnam Singh Dr.

Doctoral Theses

In this thesis, we propose two new subband transforms entitled ISITRA and YKSK transforms and their possible applications in image compression and encryption. Both these transforms are developed based on a common model of multiplication known as Bino’s model of multiplication. ISITRA is a convolution based transforms i.e., that both forward and inverse transform of ISITRA is based on convolution as in DWT or 2-channel filter bank. However, it is much more general than the existing DWT or 2-channel filter bank scheme in the sense that it we can get different kinds of filters in addition to the filters specified …


Boolean Functions With Important Cryptographic Properties., Subhamoy Maitra Dr. Feb 2001

Boolean Functions With Important Cryptographic Properties., Subhamoy Maitra Dr.

Doctoral Theses

In this thesis we concentrate on properties of cryptographically significant Boolean functions.The techniques are mainly combinstorial and provide new resulta on enumeration and construction of such functions. Initially we concentrate on a partieular subset of Boolean functions called the symmetric Boolean functions. A closed form expression for the Walsh transform of an arbitrary symmetric Boolean function is presented. We completely characterize the symmetric functions with maximum nonlinearity and show that the maximum nonlinearity of n-variable symmetrie function can be 2n-1-2[n-1l2], Moreover, new classes of symmetric balanced and symmetric correlation immune functions are considered.We provide a randomised heuristic to construct balanced …


Routing Algorithms For Channels, Switchboxes And Mcm's In Vlsi Layout Design., Sandip Das Dr. Jan 2001

Routing Algorithms For Channels, Switchboxes And Mcm's In Vlsi Layout Design., Sandip Das Dr.

Doctoral Theses

The term Very Large Scale Integration (VLSI) reflects the capability of semi- conductor industry to fabricate a complex electronic circuit consisting of millions of components on a single silicon substrate. The growth of semiconductor technol- ogy in recent years has been described by "Moore's law", enunciated in the late 1960s, which projected quadrupling of components in a chip in every three to four years. Several factors contributed to this tremendous growth : (i) reduction of line width of the basic device and interconnection wires due to the development of high- resolution lithographic techniques and improved processing capabilities, (ii) increase in …


Feature Evaluation, Classification And Rule Generation Using Fuzzy Sets And Neural Networks., Rajat Kumar De Dr. Mar 2000

Feature Evaluation, Classification And Rule Generation Using Fuzzy Sets And Neural Networks., Rajat Kumar De Dr.

Doctoral Theses

Pattern recognition and machine learning form a major area of research and develop- ment activity that encompasses the processing of pictorial and other non-numerical information obtained from the interaction between science, technology and society. A motivation for the spurt of activity in this field is the need for people to com- municate with the computing machines in their natural mode of communication. Another important motivation is that the scientists are also concerned with the idea of designing and making intelligent machines that can carry out certain tasks that we human beings do. The most salient outcome of these is the …


Quantum Stochastic Dilation Of Completely Positive Semigroups And Flows., Debashish Goswami Dr. Feb 2000

Quantum Stochastic Dilation Of Completely Positive Semigroups And Flows., Debashish Goswami Dr.

Doctoral Theses

The central theme of the present thesia is quantum stochastic dilation af semigroupe of completely panitive mapa on operator algebran. It is the sim of all mathemati- cal, or even all scientific theorics, to understand a given class of objects through a tanonical and simpler subclass of it. For example, abstract C"-algebras are studied through their conerete realisation as elgebra of operators, contractions on a Hilbert space by unitaries. Hilbert modules by the factorissble ones, to mention anly a few. In most af these caes, a general object of the relavant class is sociated with a canonical candidate of the …


Construction Of Some Combinatorial Designs Arising Out Of Statistical Experiments., Tridib Kumar Dutta Dr. Sep 1998

Construction Of Some Combinatorial Designs Arising Out Of Statistical Experiments., Tridib Kumar Dutta Dr.

Doctoral Theses

Chis dissertation considers construction of two kinds of combi natorial sesigns as used by statisticians: repeated measurements designs (RMDS) and symmetric balanced squares (SBSS). 1.1. REPEATED MEASUREMENTS DESIGNS The researchers need to perform experiments where each experimental unit receives some or all of the treatments in an appropriate sequence over a number of successive periods. These designs are known by several names in the statistical 1iterature: repeated measurements designs, crossover or changeover designs, (multiple) time series designs, and before-after designs. If there are n experimental units 1,2, ... n, t treatments and p periods 0,1, .. .p-1, applied, then an …


Neuro-Fuzzy Models For Classification And Rule Generation., Sushmita Mitra Dr. Oct 1995

Neuro-Fuzzy Models For Classification And Rule Generation., Sushmita Mitra Dr.

Doctoral Theses

Machine recognition [1, 2] of patterns can be viewed as a two-fold task, consisting of learning the invariant and common properties of a set of samples characterizing a class, and of deciding a new sample as a possible member of the class by noting that it has properties common to those of the set of samples. In other words, pattern recognition by computers can be described as a transformation from the measurenment space M to the feature space F and finally to the decision space D (1), i.e., M ⟶F⟶D.Here, the mapping 6 : F⟶D is the decision function and …


On Detection And Use Of Reflectional Symmetry In Computer Vision., Dipti Prasad Mukherjee Dr. Jul 1995

On Detection And Use Of Reflectional Symmetry In Computer Vision., Dipti Prasad Mukherjee Dr.

Doctoral Theses

The problems of detection and use of reflectional symmetry in the images of planar shape contours are studied. Symmetry, in general, provides important shape representation cues, some of which we utilise here, to acquire viewpoint information and, towards model based shape matching. We concentrate on local reflectional symmetries of emoothly curved planar objecta, though the methoda are equally applicable to polygonal objects; even this could be extended to certain three-dimensional shapes and for other object relations such as rotational symmetry.Under the affine or perspective approximation to image projection, properties of geometrie invariance are used to find (reflectional) symmetric contour pairs. …