|
|
|
|
LEADER |
03318nam a2200565 4500 |
001 |
978-3-540-44670-5 |
003 |
DE-He213 |
005 |
20191026022218.0 |
007 |
cr nn 008mamaa |
008 |
121227s2001 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540446705
|9 978-3-540-44670-5
|
024 |
7 |
|
|a 10.1007/3-540-44670-2
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA76.9.D335
|
072 |
|
7 |
|a GPJ
|2 bicssc
|
072 |
|
7 |
|a COM053000
|2 bisacsh
|
072 |
|
7 |
|a GPJ
|2 thema
|
072 |
|
7 |
|a URY
|2 thema
|
082 |
0 |
4 |
|a 005.82
|2 23
|
245 |
1 |
0 |
|a Cryptography and Lattices
|h [electronic resource] :
|b International Conference, CaLC 2001, Providence, RI, USA, March 29-30, 2001. Revised Papers /
|c edited by Joseph H. Silverman.
|
250 |
|
|
|a 1st ed. 2001.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2001.
|
300 |
|
|
|a VIII, 224 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2146
|
505 |
0 |
|
|a An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem -- Low Secret Exponent RSA Revisited -- Finding Small Solutions to Small Degree Polynomials -- Fast Reduction of Ternary Quadratic Forms -- Factoring Polynomials and 0-1 Vectors -- Approximate Integer Common Divisors -- Segment LLL-Reduction of Lattice Bases -- Segment LLL-Reduction with Floating Point Orthogonalization -- The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces -- Dimension Reduction Methods for Convolution Modular Lattices -- Improving Lattice Based Cryptosystems Using the Hermite Normal Form -- The Two Faces of Lattices in Cryptology -- A 3-Dimensional Lattice Reduction Algorithm -- The Shortest Vector Problem in Lattices with Many Cycles -- Multisequence Synthesis over an Integral Domain.
|
650 |
|
0 |
|a Data encryption (Computer science).
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Computer science-Mathematics.
|
650 |
1 |
4 |
|a Cryptology.
|0 http://scigraph.springernature.com/things/product-market-codes/I28020
|
650 |
2 |
4 |
|a Computation by Abstract Devices.
|0 http://scigraph.springernature.com/things/product-market-codes/I16013
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|0 http://scigraph.springernature.com/things/product-market-codes/I16021
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|0 http://scigraph.springernature.com/things/product-market-codes/I17028
|
650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|0 http://scigraph.springernature.com/things/product-market-codes/I17052
|
650 |
2 |
4 |
|a Algorithms.
|0 http://scigraph.springernature.com/things/product-market-codes/M14018
|
700 |
1 |
|
|a Silverman, Joseph H.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662176566
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540424888
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2146
|
856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-44670-2
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|