aboutsummaryrefslogtreecommitdiffstats
path: root/doc
Commit message (Collapse)AuthorAgeFilesLines
* The benchmark examples ran very slowly because they were passinglloyd2012-02-203-4/+4
| | | | | | | 16*1024 to an argument that treated those values as KiB, it took the RNG ~3 seconds to create 16 MiB of data to randomize the input. Change to 16. Also cap the value that can be passed to --buf-size to 1024, for a 1 MiB buffer.
* Disable this version of the SSL code by defaultlloyd2012-02-011-0/+4
|
* Add a slow but functional implementation of Camellialloyd2012-01-281-0/+2
|
* Initial run at an SRP-6a implementation. Not entirely sure about thelloyd2011-12-171-0/+3
| | | | | interface but it's a plausible start. Will probably have more insights after adding TLS hooks.
* Basic instructions for building the docslloyd2011-12-171-5/+17
|
* Add TCHead to list of userslloyd2011-12-171-0/+3
|
* Add basic NaCl targetlloyd2011-12-081-0/+2
|
* Warn the user if targetting for GCC on Windows without an explicitlloyd2011-12-021-0/+5
| | | | | --os=windows since likely they actually wanted either --os=cygwin or --os=mingw
* GCC doesn't like casting a function pointer to void* without anlloyd2011-12-021-0/+2
| | | | explicit cast.
* Add AltiVec detection on OpenBSD, contributed by Brad Smith in PR 162lloyd2011-11-281-0/+2
|
* Fix PGP key linklloyd2011-11-281-1/+1
|
* Fix link, and use sphinx to generatelloyd2011-11-281-3/+2
|
* Poll clock_gettime in High_Resolution_Timestamp::poll with whateverlloyd2011-11-111-0/+3
| | | | clock types we know about that have macros defined for them.
* Add AltiVec detection for POWER7 processorslloyd2011-11-021-0/+2
|
* Include the needed sub in the log noteslloyd2011-11-011-1/+2
|
* Mention the 1.8 branchlloyd2011-10-181-2/+3
|
* Switch to the Python 3 syntax in configure.py. A Perl one-liner in thelloyd2011-10-181-0/+5
| | | | header shows how to return it to 2.5 compatability.
* Don't set the soname on OpenBSD (PR 158)lloyd2011-10-111-0/+5
|
* Note --cpu fix, bump versionlloyd2011-09-011-0/+8
|
* Add the start of Python docslloyd2011-08-065-6/+42
| | | | | | Describe how to build a universal binary on OS X Fix tr1::function syntax so Sphinx is happy.
* Move reading list to its own filelloyd2011-07-143-23/+25
|
* 1.10.1 release1.10.1lloyd2011-07-112-23/+44
|
* merge of '040da681d3a04ab0caf2f9ba7f8492d296fd7c0c'lloyd2011-07-061-1/+1
|\ | | | | | | and '1c92abc37682d4589f50d23cb4fe86b69ed294c1'
| * Fix linklloyd2011-06-201-1/+1
| |
* | The Algorithm_Factory has this logic on looking for an object:lloyd2011-07-051-0/+5
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | - Check the cache; if found, return value - Populate cache, if the value is already there, delete the old object and save the new one. - Recheck the cache value Raja <[email protected]> pointed out on the list that this could race if multiple threads called a lookup function in close succession while the cache was cold. All of them would fail the lookup, then each of them would add it, but the values returned would be deleted by other threads. Instead, declare that first write wins. Then, the cache stays consistent even if there is a race, the only issue is an extra search and delete. Modify GOST and Skein, as their name() function did not roundtrip properly which caused failures otherwise.
* | Tick to 1.10.1 unreleased.lloyd2011-06-301-0/+3
|/ | | | | Try to detect the mtn revision (by shelling out to mtn automate), and including it in build.h as BOTAN_VERSION_VC_REVISION.
* Update with info on 1.8.12 releaselloyd2011-06-202-17/+33
|
* Tick version to 1.10.0 release1.10.0lloyd2011-06-202-2/+5
|
* Detect (though not using) the CPUID bit for the RDRAND instructionlloyd2011-06-161-0/+1
|
* Add std::swap specialization for memory containerslloyd2011-06-131-0/+2
|
* Drop InSiTo manuallloyd2011-06-101-0/+0
|
* Update build doclloyd2011-06-071-16/+25
|
* Fix linking for exampleslloyd2011-06-062-26/+26
| | | | Update download links before I forget
* Zap this, I just replaced the 1.9.18 tarball instead.lloyd2011-06-031-2/+0
|
* Tick version to 1.10.0lloyd2011-06-031-0/+9
|
* Update download linkslloyd2011-06-031-11/+11
|
* Tick to 1.9.18 release1.9.18lloyd2011-06-031-1/+1
|
* Multi-expoentiation, using the single bit variation. Using a 2 or 3lloyd2011-06-011-0/+5
| | | | | | bit window may well improve things further. Currently seeing 20-25% improvement in ECDSA signature verification and 25 to 40% in GOST-34.10 verifications.
* Add --via-amalgamation option that builds everything from a singlelloyd2011-06-011-0/+5
| | | | source file.
* FD_ZERO on Solaris uses memset, and assumes we included string.hlloyd2011-05-241-0/+5
| | | | already. Reported by Jeremy C. Reed <[email protected]>
* Only call p.sig_words once in CurveGFp constructor.lloyd2011-05-191-1/+1
| | | | Fix build log; copy and paste error.
* Reject s == 0 or r == 0 in a ECC signature.lloyd2011-05-191-11/+17
| | | | | | | | | | | | | | | In ECDSA, this cases should all be caught by the later check that R is not zero, so I don't believe there is any security danger. However the GOST 34.10 implementation did not have either check. Fortunately, the function that extracts the affine X coordinate from the Jacobian coordinates will throw an exception if the point is at infinity, so we would not in fact accept invalid signatures, but this is mostly by luck. And still represents a bit of a DoS potential. I checked the history, it looks like not checking for zeros at the start traces back to the original InSiTo code, and I copied the ECDSA code for GOST without thinking about it too much.
* Fix the very basic operations for encoding and decoding alloyd2011-05-171-1/+1
| | | | | | | | | certificate policies extension, though it's really not supported at all. Remove test code from secmem.h Fix building the examples
* Modify ECC points to do all math in Montgomery form, rather thanlloyd2011-05-171-4/+7
| | | | | | | | | | | | | converting back and forth. This gives a 10 to 20% speedup on a Core i7. In addition, the CurveGFp no longer contains a Barrett reducer, saving 3 BigInts worth of memory. Add a #if'ed out alternative to point multiplication using the Montgomery ladder technique. It runs in (more or less) constant time, but rather significantly slower than the 4 bit window technique currently used. Tweak the window sizes to match the theoretical optimums.
* Fix the problem that prevented the SSE2 IDEA implementation fromlloyd2011-05-121-0/+6
| | | | | | | | | | working correctly under Clang - the technique for emulating unsigned compare relied on signed overflow. The new method does not, and works under GCC, ICC, and Clang. Even better, the compare takes only 2 instructions instead of 4. Prevent using any of the asm implementations under Clang on x86-32. All of them crash under Clang 2.9, unclear why.
* Add base64_decode. Seems to work OK, though incremental decoding islloyd2011-05-121-0/+3
| | | | not well tested.
* Modify soname to match Unix conventions at suggestion of Debianlloyd2011-05-121-7/+20
| | | | | | | | | | maintainer. Namespace the headers in /usr/local/include/botan-1.9/botan, so multiple versions can be installed in parallel. Down version to 1.9.18 since there are a good number of changes in this release already.
* Add back BigInt::to_u32bitlloyd2011-05-101-2/+9
| | | | | | | Fix BigInt::get_substring when length is equal to 32 - an overflow would cause the mask to be equal to 0 thus producing nothing at all. Disable CVC by default, it's not ready for prime time in any sense.
* Make different targets for 32 and 64 bit Atom processors, since mostlloyd2011-05-092-0/+7
| | | | consumer/desktop level Atoms are actually 32 bit.
* Disable CMS by default, since it's pretty untested and likely unusablelloyd2011-05-061-0/+3
| | | | | | | | currently. Include the source directory name in object file names. Add some more DES test vectors.
generated by cgit v1.2.3 (git 2.39.1) at 2024-12-28 17:27:17 +0000