Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithms and computations : 10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999 proceedings / / Alok Aggarwal, C. Pandu Rangan (Eds.)
| Algorithms and computations : 10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999 proceedings / / Alok Aggarwal, C. Pandu Rangan (Eds.) |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [1999] |
| Descrizione fisica | 1 online resource (XIV, 454 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Computer software |
| ISBN | 3-540-46632-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- The Engineering of Some Bipartite Matching Programs -- Session 1(a) - Data Structure I -- General Splay: A Basic Theory and Calculus -- Static Dictionaries Supporting Rank -- Session 1(b) - Parallel & Distributed Computing I -- Multiple Spin-Block Decisions -- Asynchronous Random Polling Dynamic Load Balancing -- Session 2(a) - Approximate Algorithm I -- Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colarability -- Hardness of Approximating Independent Domination in Circle Graphs -- Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs -- Session 2(b) - Computational Intelligence -- Ordered Binary Decision Diagrams as Knowledge-Bases -- Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots -- Session 3(a) - Online Algorithm -- On-Line Load Balancing of Temporary Tasks Revisited -- Online Routing in Triangulations -- Session 3(b) - Complexity Theory I -- The Query Complexity of Program Checking by Constant-Depth Circuits -- Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle -- Session 4(a) - Approximate Algorithm II -- Efficient Approximation Algorithms for Multi-label Map Labeling -- Approximation Algorithms in Batch Processing -- Session 4(b) - Graph Algorithm I -- LexBFS-Ordering in Asteroidal Triple-Free Graphs -- Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs -- Invited Talk -- Approximation Algorithms for Some Clustering and Classification Problems -- Session 5(a) - Computational Geometry I -- How Many People Can Hide in a Terrain? -- Carrying Umbrellas: An Online Relocation Problem on Graphs -- Session 5(b) - Parallel & Distributed Computing II -- Survivable Networks with Bounded Delay: The Edge Failure Case -- Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks -- Session 6(a) - Data Structure II -- Constructing the Suffix Tree of a Tree with a Large Alphabet -- An O(1) Time Algorithm for Generating Multiset Permutations -- Session 6(b) - Complexity Theory II -- Upper Bounds for MaxSat: Further Improved -- A Linear Time Algorithm for Recognizing Regular Boolean Functions -- Session 7(a) - Computational Geometry II -- Station Layouts in the Presence of Location Constraints -- Reverse Center Location Problem -- Session 7(b) - Algorithms in Practice -- Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields -- External Memory Algorithms for Outerplanar Graphs -- Session 8(a) - Approximate Algorithm III -- A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree -- Approximation Algorithms for Channel Assignment with Constraints -- Session 8(b) - Graph Algorithm II -- Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs -- A Linear Algorithm for Finding Total Colorings of Partial k-Trees -- Invited Talk -- Topology-Oriented Approach to Robust Geometric Computation -- Session 9(a) - Approximate Algorithm IV -- Approximating Multicast Congestion -- Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts -- Session 9(b) - Parallel & Distributed Computing III -- Online Scheduling of Parallel Communications with Individual Deadlines -- A Faster Algorithm for Finding Disjoint Paths in Grids -- Session 10(a) - Computational Geometry III -- Output-Sensitive Algorithms for Uniform Partitions of Points -- Convexifying Monotone Polygons -- Session 10(b) - Graph Algorithm III -- Bisecting Two Subsets in 3-Connected Graphs -- Generalized Maximum Independent Sets for Trees in Subquadratic Time. |
| Record Nr. | UNISA-996466369203316 |
| Berlin ; ; Heidelberg : , : Springer, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and computations : 10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999 proceedings / / Alok Aggarwal, C. Pandu Rangan (Eds.)
| Algorithms and computations : 10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999 proceedings / / Alok Aggarwal, C. Pandu Rangan (Eds.) |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [1999] |
| Descrizione fisica | 1 online resource (XIV, 454 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Computer software |
| ISBN | 3-540-46632-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- The Engineering of Some Bipartite Matching Programs -- Session 1(a) - Data Structure I -- General Splay: A Basic Theory and Calculus -- Static Dictionaries Supporting Rank -- Session 1(b) - Parallel & Distributed Computing I -- Multiple Spin-Block Decisions -- Asynchronous Random Polling Dynamic Load Balancing -- Session 2(a) - Approximate Algorithm I -- Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colarability -- Hardness of Approximating Independent Domination in Circle Graphs -- Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs -- Session 2(b) - Computational Intelligence -- Ordered Binary Decision Diagrams as Knowledge-Bases -- Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots -- Session 3(a) - Online Algorithm -- On-Line Load Balancing of Temporary Tasks Revisited -- Online Routing in Triangulations -- Session 3(b) - Complexity Theory I -- The Query Complexity of Program Checking by Constant-Depth Circuits -- Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle -- Session 4(a) - Approximate Algorithm II -- Efficient Approximation Algorithms for Multi-label Map Labeling -- Approximation Algorithms in Batch Processing -- Session 4(b) - Graph Algorithm I -- LexBFS-Ordering in Asteroidal Triple-Free Graphs -- Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs -- Invited Talk -- Approximation Algorithms for Some Clustering and Classification Problems -- Session 5(a) - Computational Geometry I -- How Many People Can Hide in a Terrain? -- Carrying Umbrellas: An Online Relocation Problem on Graphs -- Session 5(b) - Parallel & Distributed Computing II -- Survivable Networks with Bounded Delay: The Edge Failure Case -- Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks -- Session 6(a) - Data Structure II -- Constructing the Suffix Tree of a Tree with a Large Alphabet -- An O(1) Time Algorithm for Generating Multiset Permutations -- Session 6(b) - Complexity Theory II -- Upper Bounds for MaxSat: Further Improved -- A Linear Time Algorithm for Recognizing Regular Boolean Functions -- Session 7(a) - Computational Geometry II -- Station Layouts in the Presence of Location Constraints -- Reverse Center Location Problem -- Session 7(b) - Algorithms in Practice -- Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields -- External Memory Algorithms for Outerplanar Graphs -- Session 8(a) - Approximate Algorithm III -- A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree -- Approximation Algorithms for Channel Assignment with Constraints -- Session 8(b) - Graph Algorithm II -- Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs -- A Linear Algorithm for Finding Total Colorings of Partial k-Trees -- Invited Talk -- Topology-Oriented Approach to Robust Geometric Computation -- Session 9(a) - Approximate Algorithm IV -- Approximating Multicast Congestion -- Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts -- Session 9(b) - Parallel & Distributed Computing III -- Online Scheduling of Parallel Communications with Individual Deadlines -- A Faster Algorithm for Finding Disjoint Paths in Grids -- Session 10(a) - Computational Geometry III -- Output-Sensitive Algorithms for Uniform Partitions of Points -- Convexifying Monotone Polygons -- Session 10(b) - Graph Algorithm III -- Bisecting Two Subsets in 3-Connected Graphs -- Generalized Maximum Independent Sets for Trees in Subquadratic Time. |
| Record Nr. | UNINA-9910143615303321 |
| Berlin ; ; Heidelberg : , : Springer, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Foundations of software technology and theoretical computer science : 19th conference, Chennai, India, December 13-15, 1999 : proceedings / / C. Pandu Rangan, V. Raman, R. Ramanujam (editors)
| Foundations of software technology and theoretical computer science : 19th conference, Chennai, India, December 13-15, 1999 : proceedings / / C. Pandu Rangan, V. Raman, R. Ramanujam (editors) |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg ; ; New York : , : Springer, , [1999] |
| Descrizione fisica | 1 online resource (XII, 460 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Software engineering |
| ISBN | 3-540-46691-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk 1 -- Recent Developments in the Theory of Arrangements of Surfaces -- Session 1(a) -- Dynamic Compressed Hyperoctrees with Application to the N-body Problem -- Largest Empty Rectangle among a Point Set -- Session 1(b) -- Renaming Is Necessary in Timed Regular Expressions -- Product Interval Automata: A Subclass of Timed Automata -- Session 2(a) -- The Complexity of Rebalancing a Binary Search Tree -- Fast Allocation and Deallocation with an Improved Buddy System -- Session 2(b) -- Optimal Bounds for Transformations of ?-Automata -- CTL+ Is Exponentially More Succinct than CTL -- Invited Talk 2 -- A Top-Down Look at a Secure Message -- Session 3 -- Explaining Updates by Minimal Sums -- A Foundation for Hybrid Knowledge Bases -- Session 4 -- Hoare Logic for Mutual Recursion and Local Variables -- Invited Talk 3 -- Explicit Substitutions and Programming Languages -- Session 5(a) -- Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings -- A Randomized Algorithm for Flow Shop Scheduling -- Session 5(b) -- Synthesizing Distributed Transition Systems from Global Specifications -- Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata -- Session 6 -- Implicit Temporal Query Languages: Towards Completeness -- On the Undecidability of Some Sub-classical First-Order Logics -- Invited Talk 4 -- How to Compute with DNA -- Session 7(a) -- A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles -- Protecting Facets in Layered Manufacturing -- Session 7(b) -- The Receptive Distributed ?-Calculus -- Series and Parallel Operations on Pomsets -- Session 8 -- Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus -- Invited Talk 5 -- Graph Isomorphism: Its Complexity and Algorithms -- Session 9(a) -- Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables -- Lower Bounds for Linear Transformed OBDDs and FBDDs -- Session 9(b) -- A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems, and Interval Transition Systems -- Graded Modalities and Resource Bisimulation -- Session 10(a) -- The Non-recursive Power of Erroneous Computation -- Analysis of Quantum Functions -- Session 10(b) -- On Sets Growing Continuously -- Model Checking Knowledge and Time in Systems with Perfect Recall -- FST&TCS — ISAAC Joint Session Talks -- The Engineering of Some Bipartite Matching Programs. |
| Record Nr. | UNINA-9910143615703321 |
| Berlin ; ; Heidelberg ; ; New York : , : Springer, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Foundations of software technology and theoretical computer science : 19th conference, Chennai, India, December 13-15, 1999 : proceedings / / C. Pandu Rangan, V. Raman, R. Ramanujam (editors)
| Foundations of software technology and theoretical computer science : 19th conference, Chennai, India, December 13-15, 1999 : proceedings / / C. Pandu Rangan, V. Raman, R. Ramanujam (editors) |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg ; ; New York : , : Springer, , [1999] |
| Descrizione fisica | 1 online resource (XII, 460 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Software engineering |
| ISBN | 3-540-46691-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk 1 -- Recent Developments in the Theory of Arrangements of Surfaces -- Session 1(a) -- Dynamic Compressed Hyperoctrees with Application to the N-body Problem -- Largest Empty Rectangle among a Point Set -- Session 1(b) -- Renaming Is Necessary in Timed Regular Expressions -- Product Interval Automata: A Subclass of Timed Automata -- Session 2(a) -- The Complexity of Rebalancing a Binary Search Tree -- Fast Allocation and Deallocation with an Improved Buddy System -- Session 2(b) -- Optimal Bounds for Transformations of ?-Automata -- CTL+ Is Exponentially More Succinct than CTL -- Invited Talk 2 -- A Top-Down Look at a Secure Message -- Session 3 -- Explaining Updates by Minimal Sums -- A Foundation for Hybrid Knowledge Bases -- Session 4 -- Hoare Logic for Mutual Recursion and Local Variables -- Invited Talk 3 -- Explicit Substitutions and Programming Languages -- Session 5(a) -- Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings -- A Randomized Algorithm for Flow Shop Scheduling -- Session 5(b) -- Synthesizing Distributed Transition Systems from Global Specifications -- Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata -- Session 6 -- Implicit Temporal Query Languages: Towards Completeness -- On the Undecidability of Some Sub-classical First-Order Logics -- Invited Talk 4 -- How to Compute with DNA -- Session 7(a) -- A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles -- Protecting Facets in Layered Manufacturing -- Session 7(b) -- The Receptive Distributed ?-Calculus -- Series and Parallel Operations on Pomsets -- Session 8 -- Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus -- Invited Talk 5 -- Graph Isomorphism: Its Complexity and Algorithms -- Session 9(a) -- Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables -- Lower Bounds for Linear Transformed OBDDs and FBDDs -- Session 9(b) -- A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems, and Interval Transition Systems -- Graded Modalities and Resource Bisimulation -- Session 10(a) -- The Non-recursive Power of Erroneous Computation -- Analysis of Quantum Functions -- Session 10(b) -- On Sets Growing Continuously -- Model Checking Knowledge and Time in Systems with Perfect Recall -- FST&TCS — ISAAC Joint Session Talks -- The Engineering of Some Bipartite Matching Programs. |
| Record Nr. | UNISA-996466344703316 |
| Berlin ; ; Heidelberg ; ; New York : , : Springer, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Progress in Cryptology – INDOCRYPT 2007 [[electronic resource] ] : 8th International Conference on Cryptology in India, Chennai, India, December 9-13, 2007, Proceedings / / edited by K. Srinathan, C. Pandu Rangan, Moti Yung
| Progress in Cryptology – INDOCRYPT 2007 [[electronic resource] ] : 8th International Conference on Cryptology in India, Chennai, India, December 9-13, 2007, Proceedings / / edited by K. Srinathan, C. Pandu Rangan, Moti Yung |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XI, 428 p.) |
| Disciplina | 001.5436 |
| Collana | Security and Cryptology |
| Soggetto topico |
Cryptography
Data encryption (Computer science) Algorithms Computer science—Mathematics Discrete mathematics Data protection Computer networks Electronic data processing—Management Cryptology Discrete Mathematics in Computer Science Data and Information Security Computer Communication Networks IT Operations |
| ISBN | 3-540-77026-7 |
| Classificazione |
004
DAT 465f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Hashing -- Linearization Attacks Against Syndrome Based Hashes -- A Meet-in-the-Middle Collision Attack Against the New FORK-256 -- Multilane HMAC— Security beyond the Birthday Limit -- Elliptic Curve -- On the Bits of Elliptic Curve Diffie-Hellman Keys -- A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography -- Cryptoanalysis -- Related-Key Attacks on the Py-Family of Ciphers and an Approach to Repair the Weaknesses -- Related-Key Differential-Linear Attacks on Reduced AES-192 -- Improved Meet-in-the-Middle Attacks on Reduced-Round DES -- Information Theoretic Security -- Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality -- Secret Swarm Unit Reactive k??Secret Sharing -- Elliptic Curve Cryptography -- New Formulae for Efficient Elliptic Curve Arithmetic -- A Graph Theoretic Analysis of Double Base Number Systems -- Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication -- Signature -- Transitive Signatures from Braid Groups -- Proxy Re-signature Schemes Without Random Oracles -- Side Channel Attack -- First-Order Differential Power Analysis on the Duplication Method -- Solving Discrete Logarithms from Partial Knowledge of the Key -- Symmetric Cryptosystem -- New Description of SMS4 by an Embedding overGF(28) -- Tweakable Enciphering Schemes from Hash-Sum-Expansion -- A Framework for Chosen IV Statistical Analysis of Stream Ciphers -- Asymmetric Cryptosystem -- Public Key Encryption with Searchable Keywords Based on Jacobi Symbols -- A Certificate-Based Proxy Cryptosystem with Revocable Proxy Decryption Power -- Short Presentation -- Computationally-Efficient Password Authenticated Key Exchange Based on Quadratic Residues -- On the k-Operation Linear Complexity of Periodic Sequences -- Trade-Off Traitor Tracing -- X-FCSR – A New Software Oriented Stream Cipher Based Upon FCSRs -- Efficient Window-Based Scalar Multiplication on Elliptic Curves Using Double-Base Number System -- Extended Multi-Property-Preserving and ECM-Construction -- Design of a Differential Power Analysis Resistant Masked AES S-Box -- LFSR Based Stream Ciphers Are Vulnerable to Power Attacks -- An Update on the Side Channel Cryptanalysis of MACs Based on Cryptographic Hash Functions -- Attacking the Filter Generator by Finding Zero Inputs of the Filtering Function -- Efficient Implementations of Some Tweakable Enciphering Schemes in Reconfigurable Hardware. |
| Record Nr. | UNISA-996465482703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Progress in Cryptology – INDOCRYPT 2007 [[electronic resource] ] : 8th International Conference on Cryptology in India, Chennai, India, December 9-13, 2007, Proceedings / / edited by K. Srinathan, C. Pandu Rangan, Moti Yung
| Progress in Cryptology – INDOCRYPT 2007 [[electronic resource] ] : 8th International Conference on Cryptology in India, Chennai, India, December 9-13, 2007, Proceedings / / edited by K. Srinathan, C. Pandu Rangan, Moti Yung |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XI, 428 p.) |
| Disciplina | 001.5436 |
| Collana | Security and Cryptology |
| Soggetto topico |
Cryptography
Data encryption (Computer science) Algorithms Computer science—Mathematics Discrete mathematics Data protection Computer networks Electronic data processing—Management Cryptology Discrete Mathematics in Computer Science Data and Information Security Computer Communication Networks IT Operations |
| ISBN | 3-540-77026-7 |
| Classificazione |
004
DAT 465f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Hashing -- Linearization Attacks Against Syndrome Based Hashes -- A Meet-in-the-Middle Collision Attack Against the New FORK-256 -- Multilane HMAC— Security beyond the Birthday Limit -- Elliptic Curve -- On the Bits of Elliptic Curve Diffie-Hellman Keys -- A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography -- Cryptoanalysis -- Related-Key Attacks on the Py-Family of Ciphers and an Approach to Repair the Weaknesses -- Related-Key Differential-Linear Attacks on Reduced AES-192 -- Improved Meet-in-the-Middle Attacks on Reduced-Round DES -- Information Theoretic Security -- Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality -- Secret Swarm Unit Reactive k??Secret Sharing -- Elliptic Curve Cryptography -- New Formulae for Efficient Elliptic Curve Arithmetic -- A Graph Theoretic Analysis of Double Base Number Systems -- Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication -- Signature -- Transitive Signatures from Braid Groups -- Proxy Re-signature Schemes Without Random Oracles -- Side Channel Attack -- First-Order Differential Power Analysis on the Duplication Method -- Solving Discrete Logarithms from Partial Knowledge of the Key -- Symmetric Cryptosystem -- New Description of SMS4 by an Embedding overGF(28) -- Tweakable Enciphering Schemes from Hash-Sum-Expansion -- A Framework for Chosen IV Statistical Analysis of Stream Ciphers -- Asymmetric Cryptosystem -- Public Key Encryption with Searchable Keywords Based on Jacobi Symbols -- A Certificate-Based Proxy Cryptosystem with Revocable Proxy Decryption Power -- Short Presentation -- Computationally-Efficient Password Authenticated Key Exchange Based on Quadratic Residues -- On the k-Operation Linear Complexity of Periodic Sequences -- Trade-Off Traitor Tracing -- X-FCSR – A New Software Oriented Stream Cipher Based Upon FCSRs -- Efficient Window-Based Scalar Multiplication on Elliptic Curves Using Double-Base Number System -- Extended Multi-Property-Preserving and ECM-Construction -- Design of a Differential Power Analysis Resistant Masked AES S-Box -- LFSR Based Stream Ciphers Are Vulnerable to Power Attacks -- An Update on the Side Channel Cryptanalysis of MACs Based on Cryptographic Hash Functions -- Attacking the Filter Generator by Finding Zero Inputs of the Filtering Function -- Efficient Implementations of Some Tweakable Enciphering Schemes in Reconfigurable Hardware. |
| Record Nr. | UNINA-9910484450503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||